./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strcspn.i --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-dietlibc/strcspn.i -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 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:30:01,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:30:01,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:30:01,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:30:01,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:30:01,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:30:01,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:30:01,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:30:01,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:30:01,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:30:01,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:30:01,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:30:01,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:30:01,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:30:01,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:30:01,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:30:01,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:30:01,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:30:01,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:30:01,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:30:01,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:30:01,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:30:01,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:30:01,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:30:01,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:30:01,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:30:01,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:30:01,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:30:01,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:30:01,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:30:01,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:30:01,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:30:01,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:30:01,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:30:01,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:30:01,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:30:01,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:30:01,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:30:01,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:30:01,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:30:01,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:30:01,176 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:30:01,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:30:01,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:30:01,194 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:30:01,194 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:30:01,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:30:01,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:30:01,207 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:30:01,207 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:30:01,208 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:30:01,208 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:30:01,208 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:30:01,209 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:30:01,209 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:30:01,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:30:01,209 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:30:01,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:30:01,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:30:01,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:30:01,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:30:01,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:30:01,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:30:01,210 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:30:01,210 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:30:01,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:30:01,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:30:01,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:30:01,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:30:01,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:30:01,212 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:30:01,212 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 -> 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 [2022-02-21 03:30:01,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:30:01,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:30:01,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:30:01,469 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:30:01,469 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:30:01,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strcspn.i [2022-02-21 03:30:01,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebc731d6/cd4822489a774009b0207e5ce84e5dbe/FLAG4311f88f7 [2022-02-21 03:30:01,992 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:30:01,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strcspn.i [2022-02-21 03:30:02,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebc731d6/cd4822489a774009b0207e5ce84e5dbe/FLAG4311f88f7 [2022-02-21 03:30:02,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebc731d6/cd4822489a774009b0207e5ce84e5dbe [2022-02-21 03:30:02,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:30:02,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:30:02,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:30:02,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:30:02,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:30:02,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:30:02" (1/1) ... [2022-02-21 03:30:02,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af59373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:02, skipping insertion in model container [2022-02-21 03:30:02,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:30:02" (1/1) ... [2022-02-21 03:30:02,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:30:02,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:30:02,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:30:02,714 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:30:02,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:30:02,768 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:30:02,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:02 WrapperNode [2022-02-21 03:30:02,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:30:02,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:30:02,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:30:02,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:30:02,777 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:30:02" (1/1) ... [2022-02-21 03:30:02,786 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:30:02" (1/1) ... [2022-02-21 03:30:02,809 INFO L137 Inliner]: procedures = 113, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2022-02-21 03:30:02,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:30:02,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:30:02,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:30:02,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:30:02,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:02" (1/1) ... [2022-02-21 03:30:02,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:02" (1/1) ... [2022-02-21 03:30:02,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:02" (1/1) ... [2022-02-21 03:30:02,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:02" (1/1) ... [2022-02-21 03:30:02,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:02" (1/1) ... [2022-02-21 03:30:02,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:02" (1/1) ... [2022-02-21 03:30:02,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:02" (1/1) ... [2022-02-21 03:30:02,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:30:02,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:30:02,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:30:02,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:30:02,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:02" (1/1) ... [2022-02-21 03:30:02,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:02,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:02,912 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:30:02,918 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:30:02,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:30:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:30:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:30:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:30:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:30:02,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:30:03,043 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:30:03,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:30:03,272 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:30:03,276 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:30:03,277 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:30:03,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:03 BoogieIcfgContainer [2022-02-21 03:30:03,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:30:03,291 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:30:03,294 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:30:03,296 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:30:03,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:03,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:30:02" (1/3) ... [2022-02-21 03:30:03,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1342d8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:30:03, skipping insertion in model container [2022-02-21 03:30:03,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:03,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:02" (2/3) ... [2022-02-21 03:30:03,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1342d8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:30:03, skipping insertion in model container [2022-02-21 03:30:03,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:03,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:03" (3/3) ... [2022-02-21 03:30:03,299 INFO L388 chiAutomizerObserver]: Analyzing ICFG strcspn.i [2022-02-21 03:30:03,349 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:30:03,349 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:30:03,349 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:30:03,349 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:30:03,349 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:30:03,349 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:30:03,350 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:30:03,350 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:30:03,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:03,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:30:03,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:03,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:03,391 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:30:03,391 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:30:03,391 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:30:03,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:03,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:30:03,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:03,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:03,399 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:30:03,399 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:30:03,403 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; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 18#L519true assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 11#L523true assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; 7#L510-4true [2022-02-21 03:30:03,404 INFO L793 eck$LassoCheckResult]: Loop: 7#L510-4true call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 13#L510-1true assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 10#L511-4true assume !true; 15#L511-5true strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; 12#L510-3true strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; 7#L510-4true [2022-02-21 03:30:03,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:03,412 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2022-02-21 03:30:03,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:03,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201302937] [2022-02-21 03:30:03,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:03,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:03,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:03,601 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:03,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:03,603 INFO L85 PathProgramCache]: Analyzing trace with hash 44069891, now seen corresponding path program 1 times [2022-02-21 03:30:03,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:03,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435810815] [2022-02-21 03:30:03,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:03,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:03,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {23#true} is VALID [2022-02-21 03:30:03,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {23#true} is VALID [2022-02-21 03:30:03,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-02-21 03:30:03,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {24#false} is VALID [2022-02-21 03:30:03,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {24#false} is VALID [2022-02-21 03:30:03,668 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:30:03,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:30:03,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435810815] [2022-02-21 03:30:03,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435810815] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:30:03,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:30:03,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:30:03,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663279000] [2022-02-21 03:30:03,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:30:03,674 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:30:03,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:30:03,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:30:03,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:30:03,696 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:03,711 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 03:30:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:30:03,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:03,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:03,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2022-02-21 03:30:03,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:30:03,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 13 transitions. [2022-02-21 03:30:03,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:30:03,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:30:03,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2022-02-21 03:30:03,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:30:03,726 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-02-21 03:30:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2022-02-21 03:30:03,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:30:03,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:03,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 13 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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:30:03,742 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 13 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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:30:03,743 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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:30:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:03,744 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-21 03:30:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-21 03:30:03,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:03,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:03,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 13 transitions. [2022-02-21 03:30:03,746 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 13 transitions. [2022-02-21 03:30:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:03,747 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-21 03:30:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-21 03:30:03,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:03,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:03,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:03,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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:30:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-02-21 03:30:03,749 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-02-21 03:30:03,749 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-02-21 03:30:03,750 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:30:03,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2022-02-21 03:30:03,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:30:03,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:03,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:03,751 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:30:03,751 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:30:03,751 INFO L791 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 45#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 52#L519 assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 48#L523 assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; 47#L510-4 [2022-02-21 03:30:03,751 INFO L793 eck$LassoCheckResult]: Loop: 47#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 49#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 42#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 43#L511-1 assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; 53#L511-5 strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; 46#L510-3 strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; 47#L510-4 [2022-02-21 03:30:03,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:03,752 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2022-02-21 03:30:03,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:03,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522326870] [2022-02-21 03:30:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:03,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:03,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:03,781 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1365737035, now seen corresponding path program 1 times [2022-02-21 03:30:03,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:03,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602584568] [2022-02-21 03:30:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:03,789 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:03,795 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:03,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:03,795 INFO L85 PathProgramCache]: Analyzing trace with hash 736220402, now seen corresponding path program 1 times [2022-02-21 03:30:03,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:03,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582914035] [2022-02-21 03:30:03,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:03,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:03,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:03,842 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:04,397 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:04,398 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:04,398 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:04,398 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:04,398 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:04,398 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:04,399 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:04,399 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:04,399 INFO L133 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration2_Lasso [2022-02-21 03:30:04,399 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:04,399 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:04,411 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:30:04,828 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:30:04,831 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:30:04,834 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:30:04,836 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:30:04,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:04,841 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:30:04,843 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:30:04,845 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:30:04,847 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:30:04,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:04,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:04,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:04,856 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:30:04,858 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:30:04,860 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:30:04,862 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:30:05,272 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:05,275 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:05,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:05,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:05,289 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:30:05,295 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:30:05,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:05,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:05,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:05,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:05,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:05,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:05,309 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:30:05,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:05,328 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:30:05,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:05,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:05,331 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:30:05,353 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:30:05,354 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:30:05,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:05,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:05,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:05,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:05,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:05,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:05,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:05,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:05,391 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:30:05,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:05,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:05,393 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:30:05,437 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:30:05,438 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:30:05,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:05,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:05,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:05,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:05,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:05,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:05,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:05,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:30:05,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:05,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:05,476 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:30:05,477 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:30:05,479 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:30:05,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:05,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:05,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:05,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:05,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:05,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:05,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:05,543 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:30:05,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:05,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:05,545 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:30:05,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:05,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:05,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:05,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:05,577 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:30:05,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:05,580 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:30:05,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:05,583 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:30:05,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:05,610 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:30:05,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:05,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:05,612 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:30:05,613 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:30:05,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:05,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:05,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:05,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:05,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:05,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:05,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:05,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:05,657 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:30:05,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:05,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:05,658 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:30:05,660 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:30:05,710 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:30:05,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:05,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:05,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:05,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:05,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:05,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:05,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:05,753 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:30:05,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:05,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:05,756 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:30:05,760 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:30:05,762 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:30:05,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:05,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:05,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:05,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:05,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:05,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:05,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:05,815 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:30:05,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:05,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:05,827 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:30:05,828 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:30:05,829 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:30:05,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:05,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:05,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:05,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:05,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:05,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:05,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:05,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:05,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:05,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:05,859 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:30:05,860 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:30:05,862 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:30:05,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:05,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:05,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:05,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:05,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:05,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:05,888 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:05,921 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:30:05,921 INFO L444 ModelExtractionUtils]: 16 out of 25 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-02-21 03:30:05,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:05,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:05,929 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:30:05,930 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:30:05,931 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:05,952 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:30:05,952 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:05,952 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10#1.base)_1, ULTIMATE.start_strcspn_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10#1.base)_1 - 1*ULTIMATE.start_strcspn_~s#1.offset Supporting invariants [] [2022-02-21 03:30:05,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:06,056 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2022-02-21 03:30:06,062 INFO L390 LassoCheck]: Loop: "call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);" "assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0;" "call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;" "strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1;" "strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset;" [2022-02-21 03:30:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:06,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:06,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:06,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:06,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {87#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {87#unseeded} is VALID [2022-02-21 03:30:06,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {87#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {87#unseeded} is VALID [2022-02-21 03:30:06,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {87#unseeded} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {191#(and unseeded (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_main_~in~0#1.base|))} is VALID [2022-02-21 03:30:06,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {191#(and unseeded (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_main_~in~0#1.base|))} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {176#(and unseeded (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} is VALID [2022-02-21 03:30:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:06,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:06,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:06,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {177#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~s#1.offset|))) (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {195#(and (<= (+ |ULTIMATE.start_strcspn_~s#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~s#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~s#1.offset|))) (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} is VALID [2022-02-21 03:30:06,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#(and (<= (+ |ULTIMATE.start_strcspn_~s#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~s#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~s#1.offset|))) (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {195#(and (<= (+ |ULTIMATE.start_strcspn_~s#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~s#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~s#1.offset|))) (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} is VALID [2022-02-21 03:30:06,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#(and (<= (+ |ULTIMATE.start_strcspn_~s#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~s#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~s#1.offset|))) (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {195#(and (<= (+ |ULTIMATE.start_strcspn_~s#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~s#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~s#1.offset|))) (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} is VALID [2022-02-21 03:30:06,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {195#(and (<= (+ |ULTIMATE.start_strcspn_~s#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~s#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~s#1.offset|))) (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {195#(and (<= (+ |ULTIMATE.start_strcspn_~s#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~s#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~s#1.offset|))) (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} is VALID [2022-02-21 03:30:06,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {195#(and (<= (+ |ULTIMATE.start_strcspn_~s#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~s#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~s#1.offset|))) (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {195#(and (<= (+ |ULTIMATE.start_strcspn_~s#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~s#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~s#1.offset|))) (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} is VALID [2022-02-21 03:30:06,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#(and (<= (+ |ULTIMATE.start_strcspn_~s#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~s#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~s#1.offset|))) (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {179#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc10#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)))) unseeded) (= |ULTIMATE.start_main_#t~malloc10#1.base| |ULTIMATE.start_strcspn_~s#1.base|))} is VALID [2022-02-21 03:30:06,228 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:30:06,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:06,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:06,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:06,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,240 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:30:06,240 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:06,290 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 20 states and 23 transitions. Complement of second has 5 states. [2022-02-21 03:30:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:06,291 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:06,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:06,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:06,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:06,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:06,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:30:06,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:06,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:06,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2022-02-21 03:30:06,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:06,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:06,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:06,295 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 13 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:06,296 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:30:06,296 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:06,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:30:06,297 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:06,297 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 23 transitions. cyclomatic complexity: 5 [2022-02-21 03:30:06,298 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:06,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:06,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:06,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:06,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:30:06,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:30:06,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:30:06,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:06,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:06,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:06,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:30:06,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 20 letters. [2022-02-21 03:30:06,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:30:06,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:30:06,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 12 letters. [2022-02-21 03:30:06,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:30:06,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:06,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:06,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:06,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:30:06,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 6 letters. [2022-02-21 03:30:06,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:30:06,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:30:06,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:06,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:30:06,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:30:06,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:06,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:30:06,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:30:06,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 6 letters. [2022-02-21 03:30:06,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:30:06,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:06,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:06,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:06,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:06,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:06,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:06,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:06,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 6 letters. [2022-02-21 03:30:06,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:06,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:06,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:06,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:06,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:30:06,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:30:06,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:30:06,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:06,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:06,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:06,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:06,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:06,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:06,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:30:06,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:06,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:30:06,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 13 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:30:06,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:06,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 23 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:30:06,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,313 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-02-21 03:30:06,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:06,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:06,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2022-02-21 03:30:06,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:06,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. cyclomatic complexity: 5 [2022-02-21 03:30:06,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:06,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 21 transitions. [2022-02-21 03:30:06,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:30:06,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:30:06,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2022-02-21 03:30:06,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:06,317 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-21 03:30:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2022-02-21 03:30:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 03:30:06,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:06,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 21 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:06,318 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 21 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:06,319 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:06,319 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:06,320 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-21 03:30:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:30:06,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:06,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:06,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 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 18 states and 21 transitions. [2022-02-21 03:30:06,321 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 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 18 states and 21 transitions. [2022-02-21 03:30:06,321 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:06,322 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-21 03:30:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:30:06,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:06,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:06,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:06,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 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:30:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-21 03:30:06,324 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-21 03:30:06,324 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-21 03:30:06,324 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:30:06,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:30:06,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:06,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:06,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:06,325 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:30:06,325 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:06,325 INFO L791 eck$LassoCheckResult]: Stem: 244#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 245#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 256#L519 assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 248#L523 assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; 249#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 250#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 240#L511-4 [2022-02-21 03:30:06,325 INFO L793 eck$LassoCheckResult]: Loop: 240#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 241#L511-1 assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 252#L512 assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; 253#L511-3 strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; 240#L511-4 [2022-02-21 03:30:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash 889571309, now seen corresponding path program 1 times [2022-02-21 03:30:06,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:06,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085690477] [2022-02-21 03:30:06,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:06,344 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:06,356 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:06,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 1 times [2022-02-21 03:30:06,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:06,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778438851] [2022-02-21 03:30:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:06,369 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:06,380 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:06,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:06,381 INFO L85 PathProgramCache]: Analyzing trace with hash 736222132, now seen corresponding path program 1 times [2022-02-21 03:30:06,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:06,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271026206] [2022-02-21 03:30:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:06,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:06,416 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:06,448 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:06,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:30:07,028 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:07,028 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:07,028 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:07,028 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:07,028 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:07,028 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:07,028 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:07,028 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:07,028 INFO L133 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration3_Lasso [2022-02-21 03:30:07,028 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:07,028 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:07,030 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:30:07,034 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:30:07,036 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:30:07,038 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:30:07,040 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:30:07,042 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:30:07,045 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:30:07,047 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:30:07,050 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:30:07,052 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:30:07,054 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:30:07,056 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:30:07,057 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:30:07,059 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:30:07,061 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:30:07,063 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:30:07,065 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:30:07,592 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:30:08,061 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:08,061 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:08,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,062 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:30:08,063 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:30:08,065 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:30:08,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:08,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:08,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:08,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 03:30:08,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,104 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:30:08,105 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:30:08,107 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:30:08,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:08,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:08,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:08,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,147 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:30:08,148 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:30:08,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:08,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:08,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:08,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:08,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,200 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:30:08,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,214 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:30:08,215 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:30:08,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:30:08,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:08,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:08,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:08,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,275 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:30:08,276 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:30:08,277 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:30:08,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:08,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:08,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:08,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,302 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:30:08,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,304 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:30:08,321 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:30:08,322 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:30:08,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:08,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:08,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:08,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,352 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:30:08,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,354 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:30:08,355 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:30:08,356 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:30:08,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:08,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:08,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,389 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:30:08,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,390 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:30:08,392 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:30:08,393 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:30:08,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:08,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:08,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:08,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,426 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:30:08,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,427 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:30:08,429 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:30:08,430 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:30:08,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:08,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:08,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:08,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,467 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:30:08,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,468 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:30:08,469 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:30:08,470 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:30:08,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:08,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:08,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,496 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:30:08,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,498 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:30:08,499 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:30:08,500 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:30:08,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:08,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:08,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:08,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:08,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,533 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:30:08,534 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:30:08,535 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:30:08,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:08,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:08,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:08,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,565 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:30:08,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,567 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:30:08,568 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:30:08,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:08,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:08,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:08,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:08,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:30:08,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,594 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:30:08,598 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:30:08,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:30:08,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:08,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:08,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:08,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:30:08,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,625 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:30:08,626 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:30:08,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:30:08,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:08,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:08,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:08,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,656 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:30:08,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,658 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:30:08,658 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:30:08,660 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:30:08,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:08,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:08,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:08,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,699 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:30:08,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,700 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:30:08,702 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:30:08,709 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:30:08,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:08,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:08,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:08,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:08,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,754 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:30:08,768 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:30:08,768 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:30:08,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:08,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:08,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:08,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:08,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:08,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:08,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:08,835 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2022-02-21 03:30:08,835 INFO L444 ModelExtractionUtils]: 29 out of 49 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-02-21 03:30:08,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:08,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:08,836 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:30:08,837 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:30:08,838 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:08,860 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:30:08,860 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:08,860 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_2, ULTIMATE.start_strcspn_~i~0#1, ULTIMATE.start_strcspn_~reject#1.offset) = 1*v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_2 - 1*ULTIMATE.start_strcspn_~i~0#1 - 1*ULTIMATE.start_strcspn_~reject#1.offset Supporting invariants [] [2022-02-21 03:30:08,879 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:30:08,959 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2022-02-21 03:30:08,962 INFO L390 LassoCheck]: Loop: "call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1;" "strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1;" [2022-02-21 03:30:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:08,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:09,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:09,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:09,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {343#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {343#unseeded} is VALID [2022-02-21 03:30:09,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {343#unseeded} is VALID [2022-02-21 03:30:09,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {343#unseeded} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {343#unseeded} is VALID [2022-02-21 03:30:09,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {343#unseeded} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {343#unseeded} is VALID [2022-02-21 03:30:09,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {343#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {343#unseeded} is VALID [2022-02-21 03:30:09,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {343#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {343#unseeded} is VALID [2022-02-21 03:30:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:09,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:30:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:09,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:09,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {346#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|)))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {466#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} is VALID [2022-02-21 03:30:09,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {466#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} is VALID [2022-02-21 03:30:09,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {466#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} is VALID [2022-02-21 03:30:09,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {466#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {446#(or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|)))) unseeded)} is VALID [2022-02-21 03:30:09,074 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:30:09,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:09,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:09,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:09,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,080 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:30:09,081 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:09,118 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 45 states and 51 transitions. Complement of second has 5 states. [2022-02-21 03:30:09,118 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:30:09,118 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:09,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. cyclomatic complexity: 5 [2022-02-21 03:30:09,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:09,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:09,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:09,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:30:09,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:09,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:09,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2022-02-21 03:30:09,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:09,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:09,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:09,121 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 5 [2022-02-21 03:30:09,122 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:09,122 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:09,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:30:09,123 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:09,123 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 51 transitions. cyclomatic complexity: 10 [2022-02-21 03:30:09,123 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:09,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:09,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:09,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:09,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:09,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:09,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:09,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:09,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:09,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:09,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:30:09,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 45 letters. Loop has 45 letters. [2022-02-21 03:30:09,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:30:09,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:30:09,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 18 letters. [2022-02-21 03:30:09,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:30:09,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:30:09,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:09,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:30:09,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:09,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:09,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:09,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:09,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:09,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:30:09,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:30:09,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:09,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:30:09,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:30:09,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:09,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:30:09,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:09,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:09,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:09,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:09,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:09,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:30:09,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:09,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:09,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:30:09,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:30:09,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:09,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2022-02-21 03:30:09,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:30:09,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:09,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 51 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 4 letters. [2022-02-21 03:30:09,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,133 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:30:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 03:30:09,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:30:09,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:30:09,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:30:09,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:09,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. cyclomatic complexity: 10 [2022-02-21 03:30:09,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:09,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 29 states and 33 transitions. [2022-02-21 03:30:09,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:30:09,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:30:09,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2022-02-21 03:30:09,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:09,137 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-02-21 03:30:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2022-02-21 03:30:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-02-21 03:30:09,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:09,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 33 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 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:30:09,139 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 33 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 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:30:09,139 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 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:30:09,139 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:09,140 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-21 03:30:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-21 03:30:09,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:09,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:09,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 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 29 states and 33 transitions. [2022-02-21 03:30:09,141 INFO L87 Difference]: Start difference. First operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 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 29 states and 33 transitions. [2022-02-21 03:30:09,141 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:09,142 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-21 03:30:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-21 03:30:09,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:09,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:09,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:09,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 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:30:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-21 03:30:09,143 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-21 03:30:09,144 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-21 03:30:09,144 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:30:09,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2022-02-21 03:30:09,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:09,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:09,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:09,145 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:30:09,145 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:09,145 INFO L791 eck$LassoCheckResult]: Stem: 532#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 533#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 545#L519 assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 536#L523 assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; 537#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 539#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 540#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 548#L511-1 assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; 546#L511-5 strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; 534#L510-3 strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; 535#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 538#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 528#L511-4 [2022-02-21 03:30:09,145 INFO L793 eck$LassoCheckResult]: Loop: 528#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 529#L511-1 assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 541#L512 assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; 542#L511-3 strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; 528#L511-4 [2022-02-21 03:30:09,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1161797001, now seen corresponding path program 2 times [2022-02-21 03:30:09,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:09,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394269063] [2022-02-21 03:30:09,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:09,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:09,161 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:09,171 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:09,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 2 times [2022-02-21 03:30:09,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:09,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902077883] [2022-02-21 03:30:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:09,176 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:09,179 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash -967302850, now seen corresponding path program 1 times [2022-02-21 03:30:09,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:09,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950619951] [2022-02-21 03:30:09,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:09,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:09,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {675#true} is VALID [2022-02-21 03:30:09,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {675#true} is VALID [2022-02-21 03:30:09,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {677#(= |ULTIMATE.start_main_~in~0#1.offset| 0)} is VALID [2022-02-21 03:30:09,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {677#(= |ULTIMATE.start_main_~in~0#1.offset| 0)} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {678#(= |ULTIMATE.start_strcspn_~reject#1.offset| 0)} is VALID [2022-02-21 03:30:09,321 INFO L290 TraceCheckUtils]: 4: Hoare triple {678#(= |ULTIMATE.start_strcspn_~reject#1.offset| 0)} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {678#(= |ULTIMATE.start_strcspn_~reject#1.offset| 0)} is VALID [2022-02-21 03:30:09,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {678#(= |ULTIMATE.start_strcspn_~reject#1.offset| 0)} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {679#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) (<= |ULTIMATE.start_strcspn_~i~0#1| 0))} is VALID [2022-02-21 03:30:09,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {679#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) (<= |ULTIMATE.start_strcspn_~i~0#1| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {680#(and (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) 0) |ULTIMATE.start_strcspn_#t~mem6#1|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0))} is VALID [2022-02-21 03:30:09,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {680#(and (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) 0) |ULTIMATE.start_strcspn_#t~mem6#1|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0))} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {681#(and (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) 0) 0) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0))} is VALID [2022-02-21 03:30:09,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {681#(and (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) 0) 0) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0))} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {681#(and (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) 0) 0) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0))} is VALID [2022-02-21 03:30:09,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#(and (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) 0) 0) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0))} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {681#(and (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) 0) 0) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0))} is VALID [2022-02-21 03:30:09,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#(and (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) 0) 0) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {681#(and (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) 0) 0) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0))} is VALID [2022-02-21 03:30:09,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#(and (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) 0) 0) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {682#(and (or (not (= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)) 0)) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) (<= |ULTIMATE.start_strcspn_~i~0#1| 0))} is VALID [2022-02-21 03:30:09,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#(and (or (not (= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|) 0)) (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)) 0)) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) (<= |ULTIMATE.start_strcspn_~i~0#1| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {683#(and (= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|) 0) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) (= |ULTIMATE.start_strcspn_#t~mem6#1| 0))} is VALID [2022-02-21 03:30:09,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {683#(and (= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|) 0) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) (= |ULTIMATE.start_strcspn_#t~mem6#1| 0))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {676#false} is VALID [2022-02-21 03:30:09,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {676#false} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {676#false} is VALID [2022-02-21 03:30:09,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#false} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {676#false} is VALID [2022-02-21 03:30:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:30:09,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:30:09,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950619951] [2022-02-21 03:30:09,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950619951] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:30:09,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487339068] [2022-02-21 03:30:09,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:09,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:30:09,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:09,340 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:30:09,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-02-21 03:30:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:09,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:30:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:09,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:09,447 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:30:09,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 03:30:09,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {675#true} is VALID [2022-02-21 03:30:09,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {675#true} is VALID [2022-02-21 03:30:09,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {675#true} is VALID [2022-02-21 03:30:09,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {675#true} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {675#true} is VALID [2022-02-21 03:30:09,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {675#true} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {675#true} is VALID [2022-02-21 03:30:09,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {702#(= |ULTIMATE.start_strcspn_~i~0#1| 0)} is VALID [2022-02-21 03:30:09,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {702#(= |ULTIMATE.start_strcspn_~i~0#1| 0)} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {706#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) |ULTIMATE.start_strcspn_#t~mem6#1|)} is VALID [2022-02-21 03:30:09,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {706#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) |ULTIMATE.start_strcspn_#t~mem6#1|)} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} is VALID [2022-02-21 03:30:09,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} is VALID [2022-02-21 03:30:09,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} is VALID [2022-02-21 03:30:09,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} is VALID [2022-02-21 03:30:09,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {723#(and (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0) (= |ULTIMATE.start_strcspn_~i~0#1| 0))} is VALID [2022-02-21 03:30:09,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {723#(and (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0) (= |ULTIMATE.start_strcspn_~i~0#1| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {727#(= |ULTIMATE.start_strcspn_#t~mem6#1| 0)} is VALID [2022-02-21 03:30:09,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {727#(= |ULTIMATE.start_strcspn_#t~mem6#1| 0)} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {676#false} is VALID [2022-02-21 03:30:09,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {676#false} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {676#false} is VALID [2022-02-21 03:30:09,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#false} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {676#false} is VALID [2022-02-21 03:30:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:30:09,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:30:09,654 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-02-21 03:30:09,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 11 [2022-02-21 03:30:09,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#false} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {676#false} is VALID [2022-02-21 03:30:09,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {676#false} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {676#false} is VALID [2022-02-21 03:30:09,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {727#(= |ULTIMATE.start_strcspn_#t~mem6#1| 0)} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {676#false} is VALID [2022-02-21 03:30:09,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {746#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)) 0)} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {727#(= |ULTIMATE.start_strcspn_#t~mem6#1| 0)} is VALID [2022-02-21 03:30:09,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {746#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)) 0)} is VALID [2022-02-21 03:30:09,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} is VALID [2022-02-21 03:30:09,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} is VALID [2022-02-21 03:30:09,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} is VALID [2022-02-21 03:30:09,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {762#(or (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0) (not (= |ULTIMATE.start_strcspn_#t~mem6#1| 0)))} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {710#(= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0)} is VALID [2022-02-21 03:30:09,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {702#(= |ULTIMATE.start_strcspn_~i~0#1| 0)} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {762#(or (= (select (select |#memory_int| |ULTIMATE.start_strcspn_~reject#1.base|) |ULTIMATE.start_strcspn_~reject#1.offset|) 0) (not (= |ULTIMATE.start_strcspn_#t~mem6#1| 0)))} is VALID [2022-02-21 03:30:09,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {702#(= |ULTIMATE.start_strcspn_~i~0#1| 0)} is VALID [2022-02-21 03:30:09,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {675#true} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {675#true} is VALID [2022-02-21 03:30:09,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {675#true} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {675#true} is VALID [2022-02-21 03:30:09,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {675#true} is VALID [2022-02-21 03:30:09,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {675#true} is VALID [2022-02-21 03:30:09,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {675#true} is VALID [2022-02-21 03:30:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:30:09,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487339068] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:30:09,675 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:30:09,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2022-02-21 03:30:09,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234563611] [2022-02-21 03:30:09,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:30:09,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:30:09,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:30:09,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:30:09,729 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:09,944 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-02-21 03:30:09,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:30:09,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:09,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:09,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 51 transitions. [2022-02-21 03:30:09,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:09,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 39 transitions. [2022-02-21 03:30:09,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:30:09,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:30:09,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2022-02-21 03:30:09,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:09,971 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-02-21 03:30:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2022-02-21 03:30:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2022-02-21 03:30:09,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:09,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 39 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 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:30:09,972 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 39 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 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:30:09,972 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 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:30:09,973 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:09,974 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-21 03:30:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-21 03:30:09,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:09,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:09,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 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 36 states and 39 transitions. [2022-02-21 03:30:09,974 INFO L87 Difference]: Start difference. First operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 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 36 states and 39 transitions. [2022-02-21 03:30:09,975 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:09,976 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-21 03:30:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-21 03:30:09,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:09,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:09,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:09,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 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:30:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-02-21 03:30:09,977 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-21 03:30:09,977 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-21 03:30:09,977 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:30:09,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2022-02-21 03:30:09,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:09,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:09,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:09,978 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:30:09,978 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:09,979 INFO L791 eck$LassoCheckResult]: Stem: 843#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 844#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 856#L519 assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 845#L523 assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; 846#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 857#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 841#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 842#L511-1 assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 865#L512 assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; 864#L511-3 strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; 863#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 861#L511-1 assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; 858#L511-5 strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; 847#L510-3 strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; 848#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 849#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 839#L511-4 [2022-02-21 03:30:09,979 INFO L793 eck$LassoCheckResult]: Loop: 839#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 840#L511-1 assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 852#L512 assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; 853#L511-3 strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; 839#L511-4 [2022-02-21 03:30:09,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1375356158, now seen corresponding path program 2 times [2022-02-21 03:30:09,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:09,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088098356] [2022-02-21 03:30:09,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:09,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:09,996 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:10,008 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 3 times [2022-02-21 03:30:10,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:10,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594174793] [2022-02-21 03:30:10,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:10,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:10,018 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1858115515, now seen corresponding path program 3 times [2022-02-21 03:30:10,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:10,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432625412] [2022-02-21 03:30:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:10,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:10,036 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:10,047 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:10,859 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:10,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:10,860 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:10,860 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:10,860 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:10,860 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:10,860 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:10,860 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:10,860 INFO L133 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration5_Lasso [2022-02-21 03:30:10,860 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:10,860 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:10,862 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:30:10,864 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:30:10,866 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:30:10,868 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:30:10,870 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:30:10,871 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:30:10,874 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:30:10,875 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:30:10,877 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:30:10,879 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:30:10,881 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:30:10,883 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:30:10,885 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:30:10,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:30:10,888 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:30:11,423 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:30:11,425 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:30:11,427 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:30:12,055 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:12,055 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:12,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,062 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:30:12,063 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:30:12,093 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:30:12,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:12,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:12,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:12,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,130 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:30:12,131 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:30:12,161 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:30:12,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:12,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:12,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:12,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:12,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,198 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:30:12,199 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:30:12,200 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:30:12,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:12,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:12,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:12,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,244 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:30:12,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,252 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:30:12,254 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:30:12,254 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:30:12,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:12,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:12,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:12,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 03:30:12,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,321 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:30:12,322 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:30:12,323 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:30:12,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:12,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:12,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:12,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,360 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:30:12,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,362 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:30:12,363 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:30:12,364 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:30:12,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:12,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:12,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:12,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,406 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:30:12,407 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:30:12,408 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:30:12,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:12,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:12,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:12,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 03:30:12,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,448 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:30:12,468 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:30:12,468 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:30:12,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:12,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:12,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:12,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,505 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:12,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:30:12,507 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:30:12,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:12,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:12,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:12,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-02-21 03:30:12,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,536 INFO L229 MonitoredProcess]: Starting monitored process 42 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:30:12,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:30:12,538 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:30:12,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:12,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:12,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:30:12,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,577 INFO L229 MonitoredProcess]: Starting monitored process 43 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:30:12,583 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:30:12,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:12,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:12,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:12,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:30:12,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:30:12,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,610 INFO L229 MonitoredProcess]: Starting monitored process 44 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:30:12,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:30:12,613 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:30:12,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:12,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:12,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:12,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:12,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,638 INFO L229 MonitoredProcess]: Starting monitored process 45 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:30:12,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:30:12,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:12,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:12,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:12,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:12,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 03:30:12,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,665 INFO L229 MonitoredProcess]: Starting monitored process 46 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:30:12,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:30:12,668 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:30:12,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:12,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:12,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:12,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 03:30:12,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,700 INFO L229 MonitoredProcess]: Starting monitored process 47 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:30:12,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:30:12,702 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:30:12,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:12,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:12,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:12,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:12,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,730 INFO L229 MonitoredProcess]: Starting monitored process 48 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:30:12,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:30:12,731 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:30:12,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:12,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:12,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:12,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:12,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:12,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:12,763 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:12,792 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2022-02-21 03:30:12,792 INFO L444 ModelExtractionUtils]: 15 out of 49 variables were initially zero. Simplification set additionally 31 variables to zero. [2022-02-21 03:30:12,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:12,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:12,794 INFO L229 MonitoredProcess]: Starting monitored process 49 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:30:12,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:30:12,795 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:12,802 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:30:12,802 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:12,802 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3, ULTIMATE.start_strcspn_~i~0#1) = 3*v_rep(select #length ULTIMATE.start_main_#t~malloc12#1.base)_3 - 2*ULTIMATE.start_strcspn_~i~0#1 Supporting invariants [] [2022-02-21 03:30:12,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:12,966 INFO L297 tatePredicateManager]: 27 out of 29 supporting invariants were superfluous and have been removed [2022-02-21 03:30:12,975 INFO L390 LassoCheck]: Loop: "call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1;" "strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1;" [2022-02-21 03:30:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:13,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 03:30:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:13,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:13,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {1021#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1021#unseeded} is VALID [2022-02-21 03:30:13,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {1021#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1021#unseeded} is VALID [2022-02-21 03:30:13,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {1021#unseeded} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1196#(and unseeded (= |ULTIMATE.start_main_~in~0#1.offset| 0))} is VALID [2022-02-21 03:30:13,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {1196#(and unseeded (= |ULTIMATE.start_main_~in~0#1.offset| 0))} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,215 INFO L290 TraceCheckUtils]: 4: Hoare triple {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {1200#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {1231#(and (= |ULTIMATE.start_strcspn_~s#1.offset| 1) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded)} is VALID [2022-02-21 03:30:13,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {1231#(and (= |ULTIMATE.start_strcspn_~s#1.offset| 1) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded)} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {1231#(and (= |ULTIMATE.start_strcspn_~s#1.offset| 1) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded)} is VALID [2022-02-21 03:30:13,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {1231#(and (= |ULTIMATE.start_strcspn_~s#1.offset| 1) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded)} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {1181#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) unseeded)} is VALID [2022-02-21 03:30:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:13,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:30:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:13,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:13,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {1182#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_strcspn_~i~0#1|) (* 3 (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|)))) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1238#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:13,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {1238#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1242#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:13,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {1242#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {1242#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:13,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {1242#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {1184#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_strcspn_~i~0#1|) (* 3 (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))))) unseeded))} is VALID [2022-02-21 03:30:13,362 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:30:13,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:13,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:13,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,378 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2022-02-21 03:30:13,378 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:13,430 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 27 states and 30 transitions. Complement of second has 5 states. [2022-02-21 03:30:13,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:13,430 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:13,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. cyclomatic complexity: 6 [2022-02-21 03:30:13,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:13,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:13,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:13,431 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:13,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:13,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2022-02-21 03:30:13,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:13,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:13,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:13,432 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 30 transitions. cyclomatic complexity: 6 [2022-02-21 03:30:13,433 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:13,433 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:13,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:13,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 6 transitions. cyclomatic complexity: 4 [2022-02-21 03:30:13,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:13,433 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:30:13,433 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 30 transitions. cyclomatic complexity: 6 [2022-02-21 03:30:13,434 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:13,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:13,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 27 letters. Loop has 27 letters. [2022-02-21 03:30:13,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:13,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:13,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 27 letters. Loop has 27 letters. [2022-02-21 03:30:13,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:13,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:13,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:13,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:13,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:30:13,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:30:13,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:30:13,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:30:13,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:30:13,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:30:13,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:30:13,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:30:13,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:30:13,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:30:13,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:30:13,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:30:13,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,442 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2022-02-21 03:30:13,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,443 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:13,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:13,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 03:30:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:13,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:13,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:13,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {1021#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1021#unseeded} is VALID [2022-02-21 03:30:13,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {1021#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1021#unseeded} is VALID [2022-02-21 03:30:13,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {1021#unseeded} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1297#(and unseeded (= |ULTIMATE.start_main_~in~0#1.offset| 0))} is VALID [2022-02-21 03:30:13,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {1297#(and unseeded (= |ULTIMATE.start_main_~in~0#1.offset| 0))} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:13,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {1301#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {1332#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:13,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {1332#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {1332#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:13,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {1332#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {1181#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) unseeded)} is VALID [2022-02-21 03:30:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:13,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:30:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:13,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:13,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {1182#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_strcspn_~i~0#1|) (* 3 (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|)))) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1339#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:13,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {1339#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1343#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:13,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {1343#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:13,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {1343#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {1184#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_strcspn_~i~0#1|) (* 3 (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))))) unseeded))} is VALID [2022-02-21 03:30:13,864 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:30:13,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:13,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:13,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,878 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2022-02-21 03:30:13,878 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:13,930 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 27 states and 30 transitions. Complement of second has 5 states. [2022-02-21 03:30:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:13,930 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:13,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. cyclomatic complexity: 6 [2022-02-21 03:30:13,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:13,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:13,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:13,931 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:13,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:13,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2022-02-21 03:30:13,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:13,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:13,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:13,931 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 30 transitions. cyclomatic complexity: 6 [2022-02-21 03:30:13,931 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:13,932 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:13,932 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:13,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 6 transitions. cyclomatic complexity: 4 [2022-02-21 03:30:13,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:13,932 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:30:13,932 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 30 transitions. cyclomatic complexity: 6 [2022-02-21 03:30:13,936 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:13,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:13,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 27 letters. Loop has 27 letters. [2022-02-21 03:30:13,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:13,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:13,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 27 letters. Loop has 27 letters. [2022-02-21 03:30:13,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:13,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:13,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:13,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:13,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:30:13,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:30:13,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:30:13,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:30:13,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:30:13,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:30:13,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:30:13,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:30:13,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:30:13,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:30:13,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:30:13,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:13,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:30:13,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,945 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2022-02-21 03:30:13,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:13,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:13,946 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:14,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 03:30:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:14,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:14,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {1021#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1021#unseeded} is VALID [2022-02-21 03:30:14,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {1021#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1021#unseeded} is VALID [2022-02-21 03:30:14,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {1021#unseeded} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1398#(and unseeded (= |ULTIMATE.start_main_~in~0#1.offset| 0))} is VALID [2022-02-21 03:30:14,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {1398#(and unseeded (= |ULTIMATE.start_main_~in~0#1.offset| 0))} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:14,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:14,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:14,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:14,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:14,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:14,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:14,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:14,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:14,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:14,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {1402#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {1433#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:14,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {1433#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {1433#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:14,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {1433#(and (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {1181#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) unseeded)} is VALID [2022-02-21 03:30:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:14,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:30:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:14,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:14,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {1182#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_strcspn_~i~0#1|) (* 3 (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|)))) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1440#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:14,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {1440#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1444#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:14,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {1444#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {1444#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:14,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {1444#(and (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|) 3))) (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {1184#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (= |ULTIMATE.start_strcspn_~reject#1.base| |ULTIMATE.start_main_#t~malloc12#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_strcspn_~i~0#1|) (* 3 (select |#length| |ULTIMATE.start_main_#t~malloc12#1.base|))))) unseeded))} is VALID [2022-02-21 03:30:14,366 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:30:14,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:14,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:14,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:14,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,382 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2022-02-21 03:30:14,382 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:14,565 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 6. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 56 states and 63 transitions. Complement of second has 11 states. [2022-02-21 03:30:14,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2022-02-21 03:30:14,566 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:14,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. cyclomatic complexity: 6 [2022-02-21 03:30:14,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:14,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:14,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:14,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:14,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:14,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:14,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 63 transitions. [2022-02-21 03:30:14,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:14,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:14,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:14,568 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 30 transitions. cyclomatic complexity: 6 [2022-02-21 03:30:14,568 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:14,568 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:14,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:14,569 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:14,569 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 56 states and 63 transitions. cyclomatic complexity: 12 [2022-02-21 03:30:14,570 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:14,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:14,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:30:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:30:14,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:30:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 28 letters. Loop has 4 letters. [2022-02-21 03:30:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:30:14,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 56 letters. Loop has 56 letters. [2022-02-21 03:30:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:30:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 27 letters. Loop has 27 letters. [2022-02-21 03:30:14,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:14,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:30:14,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:14,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:30:14,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:30:14,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:14,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:30:14,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:30:14,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:14,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:30:14,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:14,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:14,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:14,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:30:14,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:14,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:30:14,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:30:14,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:30:14,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:30:14,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:14,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 28 letters. Loop has 4 letters. [2022-02-21 03:30:14,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:14,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:14,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 4 letters. [2022-02-21 03:30:14,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:14,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:30:14,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 30 letters. Loop has 4 letters. [2022-02-21 03:30:14,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:30:14,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 30 transitions. cyclomatic complexity: 6 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:30:14,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 31 letters. Loop has 4 letters. [2022-02-21 03:30:14,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 63 transitions. cyclomatic complexity: 12 Stem has 31 letters. Loop has 4 letters. [2022-02-21 03:30:14,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,581 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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:30:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-02-21 03:30:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:30:14,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:30:14,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:30:14,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:14,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 63 transitions. cyclomatic complexity: 12 [2022-02-21 03:30:14,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:14,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 42 states and 46 transitions. [2022-02-21 03:30:14,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:30:14,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:30:14,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2022-02-21 03:30:14,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:14,585 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-02-21 03:30:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2022-02-21 03:30:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-02-21 03:30:14,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:14,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 46 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:14,587 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 46 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:14,587 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:14,587 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:14,588 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-02-21 03:30:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-02-21 03:30:14,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:14,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:14,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states and 46 transitions. [2022-02-21 03:30:14,589 INFO L87 Difference]: Start difference. First operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states and 46 transitions. [2022-02-21 03:30:14,589 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:14,590 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-02-21 03:30:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-02-21 03:30:14,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:14,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:14,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:14,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-02-21 03:30:14,592 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-02-21 03:30:14,592 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-02-21 03:30:14,592 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:30:14,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2022-02-21 03:30:14,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:14,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:14,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:14,593 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-02-21 03:30:14,593 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:14,593 INFO L791 eck$LassoCheckResult]: Stem: 1535#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1536#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 1547#L519 assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1539#L523 assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; 1540#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 1549#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 1561#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 1559#L511-1 assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 1558#L512 assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; 1550#L511-3 strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; 1551#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 1560#L511-1 assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; 1548#L511-5 strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; 1537#L510-3 strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; 1538#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 1542#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 1533#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 1534#L511-1 assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 1545#L512 assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; 1546#L511-3 strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; 1557#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 1556#L511-1 assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; 1555#L511-5 strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; 1554#L510-3 strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; 1552#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 1541#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 1531#L511-4 [2022-02-21 03:30:14,593 INFO L793 eck$LassoCheckResult]: Loop: 1531#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 1532#L511-1 assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 1543#L512 assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; 1544#L511-3 strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; 1531#L511-4 [2022-02-21 03:30:14,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1550213327, now seen corresponding path program 4 times [2022-02-21 03:30:14,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:14,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220150287] [2022-02-21 03:30:14,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:14,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:14,611 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:14,622 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:14,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 4 times [2022-02-21 03:30:14,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:14,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782694745] [2022-02-21 03:30:14,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:14,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:14,627 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:14,630 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:14,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:14,630 INFO L85 PathProgramCache]: Analyzing trace with hash 229061526, now seen corresponding path program 5 times [2022-02-21 03:30:14,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:14,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51515052] [2022-02-21 03:30:14,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:14,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:14,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:14,659 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:15,807 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:15,808 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:15,808 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:15,808 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:15,808 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:15,808 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:15,808 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:15,808 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:15,808 INFO L133 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration6_Lasso [2022-02-21 03:30:15,808 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:15,808 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:15,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:30:15,812 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:30:15,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:30:15,816 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:30:15,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:30:15,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:30:15,821 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:30:15,823 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:30:15,825 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:30:15,827 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:30:15,829 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:30:15,834 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:30:15,836 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:30:15,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:15,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:15,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:15,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:15,847 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:30:16,608 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-02-21 03:30:17,609 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:17,609 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:17,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,611 INFO L229 MonitoredProcess]: Starting monitored process 50 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:30:17,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:30:17,613 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:30:17,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:17,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:17,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:17,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:17,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-02-21 03:30:17,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,646 INFO L229 MonitoredProcess]: Starting monitored process 51 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:30:17,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:30:17,648 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:30:17,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:17,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:17,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:17,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:17,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,690 INFO L229 MonitoredProcess]: Starting monitored process 52 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:30:17,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:30:17,692 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:30:17,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:17,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:17,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:17,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:17,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-02-21 03:30:17,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,715 INFO L229 MonitoredProcess]: Starting monitored process 53 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:30:17,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:30:17,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:30:17,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:17,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:17,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:17,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:17,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-02-21 03:30:17,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,746 INFO L229 MonitoredProcess]: Starting monitored process 54 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:30:17,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:30:17,748 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:30:17,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:17,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:17,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:17,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:17,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-02-21 03:30:17,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,772 INFO L229 MonitoredProcess]: Starting monitored process 55 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:30:17,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 03:30:17,773 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:30:17,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:17,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:17,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:17,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:17,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:17,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,797 INFO L229 MonitoredProcess]: Starting monitored process 56 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:30:17,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 03:30:17,799 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:30:17,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:17,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:17,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:17,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-02-21 03:30:17,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,836 INFO L229 MonitoredProcess]: Starting monitored process 57 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:30:17,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 03:30:17,837 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:30:17,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:17,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:17,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:17,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:17,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-02-21 03:30:17,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,872 INFO L229 MonitoredProcess]: Starting monitored process 58 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:30:17,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 03:30:17,874 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:30:17,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:17,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:17,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:17,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-02-21 03:30:17,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,899 INFO L229 MonitoredProcess]: Starting monitored process 59 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:30:17,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 03:30:17,901 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:30:17,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:17,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:17,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:17,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:17,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-02-21 03:30:17,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,924 INFO L229 MonitoredProcess]: Starting monitored process 60 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:30:17,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 03:30:17,925 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:30:17,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:17,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:17,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:17,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:17,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:17,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,948 INFO L229 MonitoredProcess]: Starting monitored process 61 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:30:17,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 03:30:17,950 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:30:17,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:17,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:17,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:17,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:17,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:17,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:17,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:17,987 INFO L229 MonitoredProcess]: Starting monitored process 62 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:30:17,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 03:30:17,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:17,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:17,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:17,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:17,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:17,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:17,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:17,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:18,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:18,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:18,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:18,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:18,024 INFO L229 MonitoredProcess]: Starting monitored process 63 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:30:18,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 03:30:18,026 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:30:18,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:18,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:18,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:18,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:18,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:18,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:18,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:18,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:18,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:18,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:18,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:18,060 INFO L229 MonitoredProcess]: Starting monitored process 64 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:30:18,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 03:30:18,062 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:30:18,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:18,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:18,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:18,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:18,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:18,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:18,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:18,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:18,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:18,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:18,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:18,084 INFO L229 MonitoredProcess]: Starting monitored process 65 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:30:18,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-02-21 03:30:18,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:30:18,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:18,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:18,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:18,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:18,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:18,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:18,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:18,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:18,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-02-21 03:30:18,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:18,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:18,111 INFO L229 MonitoredProcess]: Starting monitored process 66 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:30:18,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 03:30:18,112 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:30:18,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:18,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:18,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:18,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:18,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:18,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:18,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:18,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:18,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:18,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:18,138 INFO L229 MonitoredProcess]: Starting monitored process 67 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:30:18,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 03:30:18,140 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:30:18,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:18,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:18,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:18,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:18,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:18,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:18,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:18,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-02-21 03:30:18,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:18,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:18,181 INFO L229 MonitoredProcess]: Starting monitored process 68 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:30:18,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 03:30:18,183 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:30:18,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:18,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:18,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:18,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:18,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:18,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:18,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:18,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:18,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:18,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:18,221 INFO L229 MonitoredProcess]: Starting monitored process 69 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:30:18,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 03:30:18,223 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:30:18,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:18,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:18,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:18,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:18,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:18,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:18,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:18,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:18,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:18,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:18,262 INFO L229 MonitoredProcess]: Starting monitored process 70 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:30:18,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-02-21 03:30:18,263 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:30:18,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:18,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:18,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:18,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:18,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:18,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:18,294 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:18,307 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:30:18,307 INFO L444 ModelExtractionUtils]: 38 out of 52 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 03:30:18,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:18,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:18,313 INFO L229 MonitoredProcess]: Starting monitored process 71 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:30:18,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-02-21 03:30:18,327 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:18,344 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:30:18,345 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:18,345 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0#1, v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_4) = -2*ULTIMATE.start_strcspn_~i~0#1 + 5*v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_4 Supporting invariants [] [2022-02-21 03:30:18,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:18,515 INFO L297 tatePredicateManager]: 39 out of 40 supporting invariants were superfluous and have been removed [2022-02-21 03:30:18,519 INFO L390 LassoCheck]: Loop: "call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1;" "strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1;" [2022-02-21 03:30:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:18,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:18,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:30:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:18,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:18,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {1755#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1755#unseeded} is VALID [2022-02-21 03:30:18,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {1755#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1755#unseeded} is VALID [2022-02-21 03:30:18,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {1755#unseeded} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1984#(and unseeded (= |ULTIMATE.start_main_~in~0#1.offset| 0))} is VALID [2022-02-21 03:30:18,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {1984#(and unseeded (= |ULTIMATE.start_main_~in~0#1.offset| 0))} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:18,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:18,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:18,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:18,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:18,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:18,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:18,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:18,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:18,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:18,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {1988#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:18,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:18,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:18,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:18,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:18,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:18,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:18,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:18,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:18,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:18,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {2019#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2050#(and (= |ULTIMATE.start_strcspn_~s#1.offset| 2) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded)} is VALID [2022-02-21 03:30:18,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {2050#(and (= |ULTIMATE.start_strcspn_~s#1.offset| 2) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded)} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2050#(and (= |ULTIMATE.start_strcspn_~s#1.offset| 2) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded)} is VALID [2022-02-21 03:30:18,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {2050#(and (= |ULTIMATE.start_strcspn_~s#1.offset| 2) (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded)} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {1969#(and unseeded (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)))} is VALID [2022-02-21 03:30:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:18,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:18,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:18,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {1970#(and (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* 5 (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (* (- 2) |ULTIMATE.start_strcspn_~i~0#1|))))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2057#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:18,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {2057#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2061#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:18,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {2061#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2061#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:18,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {2061#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {1972#(and (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (or (and (>= oldRank0 0) (> oldRank0 (+ (* 5 (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (* (- 2) |ULTIMATE.start_strcspn_~i~0#1|)))) unseeded))} is VALID [2022-02-21 03:30:18,878 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:30:18,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:18,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:18,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,896 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2022-02-21 03:30:18,896 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:18,946 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Result 37 states and 41 transitions. Complement of second has 5 states. [2022-02-21 03:30:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:18,947 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:18,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:18,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:18,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:18,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:18,947 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:18,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:18,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2022-02-21 03:30:18,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:18,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:18,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:18,947 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 41 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:18,948 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:18,948 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:18,948 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:18,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 6 transitions. cyclomatic complexity: 4 [2022-02-21 03:30:18,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:18,948 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:30:18,948 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 41 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:18,949 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:18,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:18,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:18,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:18,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:18,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:18,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:18,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:18,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:18,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:18,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:18,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:18,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:18,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:18,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:18,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:18,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:18,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:18,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:18,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:18,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:18,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:18,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,954 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2022-02-21 03:30:18,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:18,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:18,955 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:19,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:30:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:19,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:19,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:19,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {1755#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1755#unseeded} is VALID [2022-02-21 03:30:19,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {1755#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1755#unseeded} is VALID [2022-02-21 03:30:19,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {1755#unseeded} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2126#(and unseeded (= |ULTIMATE.start_main_~in~0#1.offset| 0))} is VALID [2022-02-21 03:30:19,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {2126#(and unseeded (= |ULTIMATE.start_main_~in~0#1.offset| 0))} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {2130#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {2161#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2192#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ |ULTIMATE.start_strcspn_~s#1.offset| (- 2)) 0))} is VALID [2022-02-21 03:30:19,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {2192#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ |ULTIMATE.start_strcspn_~s#1.offset| (- 2)) 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2192#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ |ULTIMATE.start_strcspn_~s#1.offset| (- 2)) 0))} is VALID [2022-02-21 03:30:19,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {2192#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ |ULTIMATE.start_strcspn_~s#1.offset| (- 2)) 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {1969#(and unseeded (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)))} is VALID [2022-02-21 03:30:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:19,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:19,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:19,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {1970#(and (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* 5 (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (* (- 2) |ULTIMATE.start_strcspn_~i~0#1|))))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2199#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:19,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {2199#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2203#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:19,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {2203#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2203#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:19,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {2203#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {1972#(and (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (or (and (>= oldRank0 0) (> oldRank0 (+ (* 5 (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (* (- 2) |ULTIMATE.start_strcspn_~i~0#1|)))) unseeded))} is VALID [2022-02-21 03:30:19,345 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:30:19,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:19,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:19,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,362 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 3 loop predicates [2022-02-21 03:30:19,362 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:19,407 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Result 37 states and 41 transitions. Complement of second has 5 states. [2022-02-21 03:30:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:19,407 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:19,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:19,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:19,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:19,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:19,407 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:19,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:19,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2022-02-21 03:30:19,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:19,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:19,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:19,408 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 41 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:19,408 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:19,408 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:19,408 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:19,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 6 transitions. cyclomatic complexity: 4 [2022-02-21 03:30:19,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:19,408 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:30:19,408 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 41 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:19,409 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:19,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:19,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:19,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:19,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:19,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:19,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:19,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:19,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:19,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:19,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:19,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:19,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:19,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:19,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:19,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:19,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:19,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:19,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:19,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,415 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2022-02-21 03:30:19,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,416 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:19,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:19,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:30:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:19,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:19,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {1755#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1755#unseeded} is VALID [2022-02-21 03:30:19,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {1755#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1755#unseeded} is VALID [2022-02-21 03:30:19,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {1755#unseeded} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2268#(and unseeded (= |ULTIMATE.start_main_~in~0#1.offset| 0))} is VALID [2022-02-21 03:30:19,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {2268#(and unseeded (= |ULTIMATE.start_main_~in~0#1.offset| 0))} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} is VALID [2022-02-21 03:30:19,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {2272#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= |ULTIMATE.start_strcspn_~s#1.offset| 0))} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} is VALID [2022-02-21 03:30:19,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {2303#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|) 0))} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2334#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ |ULTIMATE.start_strcspn_~s#1.offset| (- 2)) 0))} is VALID [2022-02-21 03:30:19,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {2334#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ |ULTIMATE.start_strcspn_~s#1.offset| (- 2)) 0))} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2334#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ |ULTIMATE.start_strcspn_~s#1.offset| (- 2)) 0))} is VALID [2022-02-21 03:30:19,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {2334#(and (= |ULTIMATE.start_strcspn_~reject#1.offset| 0) unseeded (= (+ |ULTIMATE.start_strcspn_~s#1.offset| (- 2)) 0))} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {1969#(and unseeded (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)))} is VALID [2022-02-21 03:30:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:19,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:19,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:19,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {1970#(and (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* 5 (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (* (- 2) |ULTIMATE.start_strcspn_~i~0#1|))))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2341#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:19,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {2341#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2345#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:19,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {2345#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2345#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} is VALID [2022-02-21 03:30:19,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {2345#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (<= 0 |ULTIMATE.start_strcspn_~s#1.offset|) (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (>= oldRank0 (+ (* |ULTIMATE.start_strcspn_~i~0#1| (- 2)) (* (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) 5))) (<= 0 (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset|)))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {1972#(and (= (+ |ULTIMATE.start_strcspn_~reject#1.offset| 1) (+ (- 1) |ULTIMATE.start_strcspn_~s#1.offset|)) (or (and (>= oldRank0 0) (> oldRank0 (+ (* 5 (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (* (- 2) |ULTIMATE.start_strcspn_~i~0#1|)))) unseeded))} is VALID [2022-02-21 03:30:19,776 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:30:19,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:19,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:19,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,793 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2022-02-21 03:30:19,793 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:19,991 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 8. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Result 66 states and 74 transitions. Complement of second has 13 states. [2022-02-21 03:30:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2022-02-21 03:30:19,991 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:19,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:19,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:19,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:19,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:19,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:19,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:19,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:19,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 74 transitions. [2022-02-21 03:30:19,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:19,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:19,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:19,995 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 41 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:19,995 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:19,995 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:19,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:19,996 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:19,996 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 66 states and 74 transitions. cyclomatic complexity: 14 [2022-02-21 03:30:19,996 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:19,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:30:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:30:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:30:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 66 letters. Loop has 66 letters. [2022-02-21 03:30:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 66 letters. Loop has 66 letters. [2022-02-21 03:30:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 66 letters. Loop has 66 letters. [2022-02-21 03:30:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:19,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:19,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:30:19,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:30:19,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:30:19,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:30:19,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:19,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:19,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 28 letters. Loop has 4 letters. [2022-02-21 03:30:19,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:19,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:19,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 29 letters. Loop has 4 letters. [2022-02-21 03:30:19,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:19,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:19,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:19,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 4 letters. [2022-02-21 03:30:19,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:30:19,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:30:19,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:30:19,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:19,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:19,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:20,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:20,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:20,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:20,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:20,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:30:20,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:30:20,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:30:20,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 41 transitions. cyclomatic complexity: 8 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:30:20,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:30:20,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 66 states and 74 transitions. cyclomatic complexity: 14 Stem has 41 letters. Loop has 4 letters. [2022-02-21 03:30:20,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,001 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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:30:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-02-21 03:30:20,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 26 letters. Loop has 4 letters. [2022-02-21 03:30:20,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 30 letters. Loop has 4 letters. [2022-02-21 03:30:20,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 26 letters. Loop has 8 letters. [2022-02-21 03:30:20,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:20,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. cyclomatic complexity: 14 [2022-02-21 03:30:20,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:20,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 52 states and 57 transitions. [2022-02-21 03:30:20,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:30:20,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:30:20,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 57 transitions. [2022-02-21 03:30:20,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:20,006 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-02-21 03:30:20,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 57 transitions. [2022-02-21 03:30:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2022-02-21 03:30:20,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:20,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states and 57 transitions. Second operand has 47 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:20,025 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states and 57 transitions. Second operand has 47 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:20,025 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 47 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:20,026 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:20,027 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-02-21 03:30:20,027 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-02-21 03:30:20,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:20,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:20,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 52 states and 57 transitions. [2022-02-21 03:30:20,028 INFO L87 Difference]: Start difference. First operand has 47 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 52 states and 57 transitions. [2022-02-21 03:30:20,028 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:20,034 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-02-21 03:30:20,034 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-02-21 03:30:20,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:20,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:20,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:20,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-02-21 03:30:20,038 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-02-21 03:30:20,038 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-02-21 03:30:20,038 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:30:20,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. [2022-02-21 03:30:20,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:20,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:20,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:20,039 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-02-21 03:30:20,039 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:30:20,039 INFO L791 eck$LassoCheckResult]: Stem: 2450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2451#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 2462#L519 assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2454#L523 assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; 2455#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 2457#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 2448#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 2449#L511-1 assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 2466#L512 assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; 2491#L511-3 strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; 2490#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 2489#L511-1 assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; 2488#L511-5 strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; 2487#L510-3 strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; 2464#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 2465#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 2492#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 2480#L511-1 assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 2460#L512 assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; 2461#L511-3 strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; 2467#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 2477#L511-1 assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; 2463#L511-5 strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; 2452#L510-3 strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; 2453#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 2486#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 2485#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 2481#L511-1 assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 2482#L512 assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; 2475#L511-3 strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; 2476#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 2472#L511-1 assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; 2471#L511-5 strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; 2470#L510-3 strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; 2468#L510-4 call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); 2456#L510-1 assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; 2446#L511-4 [2022-02-21 03:30:20,040 INFO L793 eck$LassoCheckResult]: Loop: 2446#L511-4 call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 2447#L511-1 assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); 2458#L512 assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; 2459#L511-3 strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; 2446#L511-4 [2022-02-21 03:30:20,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:20,040 INFO L85 PathProgramCache]: Analyzing trace with hash -43865248, now seen corresponding path program 6 times [2022-02-21 03:30:20,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:20,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258483227] [2022-02-21 03:30:20,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:20,068 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:20,092 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:20,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1698248, now seen corresponding path program 5 times [2022-02-21 03:30:20,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:20,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509127406] [2022-02-21 03:30:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:20,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:20,097 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:20,099 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:20,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:20,099 INFO L85 PathProgramCache]: Analyzing trace with hash -345387609, now seen corresponding path program 7 times [2022-02-21 03:30:20,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:20,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370410022] [2022-02-21 03:30:20,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:20,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:20,121 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:20,135 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:21,550 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:21,550 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:21,550 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:21,550 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:21,550 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:21,550 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:21,550 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:21,550 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:21,550 INFO L133 ssoRankerPreferences]: Filename of dumped script: strcspn.i_Iteration7_Lasso [2022-02-21 03:30:21,550 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:21,550 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:21,552 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:30:21,554 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:30:21,556 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:30:21,558 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:30:21,559 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:30:21,561 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:30:21,562 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:30:21,564 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:30:21,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:21,567 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:30:22,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:22,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:22,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:22,236 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:30:22,238 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:30:22,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:22,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:22,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:22,531 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2022-02-21 03:30:27,391 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:27,391 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:27,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,392 INFO L229 MonitoredProcess]: Starting monitored process 72 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:30:27,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-02-21 03:30:27,407 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:30:27,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:27,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:27,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:27,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:27,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:27,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,446 INFO L229 MonitoredProcess]: Starting monitored process 73 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:30:27,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-02-21 03:30:27,448 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:30:27,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:27,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:27,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:27,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-02-21 03:30:27,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,476 INFO L229 MonitoredProcess]: Starting monitored process 74 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:30:27,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-02-21 03:30:27,478 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:30:27,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:27,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:27,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:27,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:27,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,545 INFO L229 MonitoredProcess]: Starting monitored process 75 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:30:27,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-02-21 03:30:27,547 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:30:27,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:27,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:27,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:27,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:27,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:27,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,572 INFO L229 MonitoredProcess]: Starting monitored process 76 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:30:27,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-02-21 03:30:27,574 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:30:27,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:27,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:27,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:27,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:27,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:27,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,618 INFO L229 MonitoredProcess]: Starting monitored process 77 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:30:27,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-02-21 03:30:27,620 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:30:27,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:27,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:27,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:27,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:27,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:27,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,651 INFO L229 MonitoredProcess]: Starting monitored process 78 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:30:27,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-02-21 03:30:27,654 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:30:27,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:27,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:27,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:27,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:27,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:27,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,679 INFO L229 MonitoredProcess]: Starting monitored process 79 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:30:27,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-02-21 03:30:27,681 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:30:27,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:27,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:27,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:27,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:27,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:27,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,706 INFO L229 MonitoredProcess]: Starting monitored process 80 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:30:27,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-02-21 03:30:27,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:27,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:27,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:27,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:27,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:27,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-02-21 03:30:27,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,733 INFO L229 MonitoredProcess]: Starting monitored process 81 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:30:27,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-02-21 03:30:27,735 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:30:27,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:27,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:27,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:27,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-02-21 03:30:27,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,760 INFO L229 MonitoredProcess]: Starting monitored process 82 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:30:27,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-02-21 03:30:27,762 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:30:27,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:27,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:27,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:27,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-02-21 03:30:27,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,791 INFO L229 MonitoredProcess]: Starting monitored process 83 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:30:27,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-02-21 03:30:27,793 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:30:27,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:27,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:27,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:27,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-02-21 03:30:27,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,832 INFO L229 MonitoredProcess]: Starting monitored process 84 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:30:27,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-02-21 03:30:27,835 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:30:27,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:27,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:27,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:27,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:27,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:27,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:27,858 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:27,869 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:30:27,869 INFO L444 ModelExtractionUtils]: 16 out of 43 variables were initially zero. Simplification set additionally 23 variables to zero. [2022-02-21 03:30:27,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:27,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:27,871 INFO L229 MonitoredProcess]: Starting monitored process 85 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:30:27,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-02-21 03:30:27,873 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:27,879 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:30:27,879 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:27,879 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_5, ULTIMATE.start_strcspn_~reject#1.offset, ULTIMATE.start_strcspn_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_strcspn_~reject#1.base)_5 - 1*ULTIMATE.start_strcspn_~reject#1.offset - 1*ULTIMATE.start_strcspn_~i~0#1 Supporting invariants [] [2022-02-21 03:30:27,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:28,061 INFO L297 tatePredicateManager]: 44 out of 44 supporting invariants were superfluous and have been removed [2022-02-21 03:30:28,064 INFO L390 LassoCheck]: Loop: "call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1);" "assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1;" "strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1;" [2022-02-21 03:30:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:28,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-02-21 03:30:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:28,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {2722#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2722#unseeded} is VALID [2022-02-21 03:30:28,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {2722#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {2722#unseeded} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {2722#unseeded} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {2722#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2722#unseeded} is VALID [2022-02-21 03:30:28,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {2722#unseeded} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {2722#unseeded} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {2722#unseeded} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {2722#unseeded} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {2722#unseeded} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2722#unseeded} is VALID [2022-02-21 03:30:28,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {2722#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2722#unseeded} is VALID [2022-02-21 03:30:28,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {2722#unseeded} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {2722#unseeded} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {2722#unseeded} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {2722#unseeded} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {2722#unseeded} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2722#unseeded} is VALID [2022-02-21 03:30:28,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {2722#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2722#unseeded} is VALID [2022-02-21 03:30:28,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {2722#unseeded} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {2722#unseeded} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {2722#unseeded} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {2722#unseeded} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {2722#unseeded} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2722#unseeded} is VALID [2022-02-21 03:30:28,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {2722#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2722#unseeded} is VALID [2022-02-21 03:30:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:30:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:28,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {2725#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|)))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {3065#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} is VALID [2022-02-21 03:30:28,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {3065#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {3065#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} is VALID [2022-02-21 03:30:28,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {3065#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {3065#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} is VALID [2022-02-21 03:30:28,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {3065#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2955#(or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|)))) unseeded)} is VALID [2022-02-21 03:30:28,286 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:30:28,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,292 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:30:28,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,292 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:30:28,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,322 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Result 55 states and 61 transitions. Complement of second has 5 states. [2022-02-21 03:30:28,322 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:30:28,322 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:28,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. cyclomatic complexity: 10 [2022-02-21 03:30:28,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:28,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:28,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:30:28,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:28,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:28,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 61 transitions. [2022-02-21 03:30:28,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:28,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:28,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:28,324 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 52 transitions. cyclomatic complexity: 10 [2022-02-21 03:30:28,327 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:28,327 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:30:28,327 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:28,327 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 61 transitions. cyclomatic complexity: 11 [2022-02-21 03:30:28,328 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:28,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:30:28,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:30:28,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:30:28,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:30:28,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:30:28,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:30:28,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:30:28,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:30:28,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:30:28,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,339 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 03:30:28,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,341 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:28,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:28,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {2722#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2722#unseeded} is VALID [2022-02-21 03:30:28,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {2722#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {2722#unseeded} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {2722#unseeded} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {2722#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2722#unseeded} is VALID [2022-02-21 03:30:28,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {2722#unseeded} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {2722#unseeded} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {2722#unseeded} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {2722#unseeded} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {2722#unseeded} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2722#unseeded} is VALID [2022-02-21 03:30:28,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {2722#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2722#unseeded} is VALID [2022-02-21 03:30:28,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {2722#unseeded} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {2722#unseeded} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {2722#unseeded} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {2722#unseeded} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {2722#unseeded} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2722#unseeded} is VALID [2022-02-21 03:30:28,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {2722#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2722#unseeded} is VALID [2022-02-21 03:30:28,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {2722#unseeded} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {2722#unseeded} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {2722#unseeded} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {2722#unseeded} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {2722#unseeded} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2722#unseeded} is VALID [2022-02-21 03:30:28,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {2722#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2722#unseeded} is VALID [2022-02-21 03:30:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:30:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:28,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {2725#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|)))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {3246#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} is VALID [2022-02-21 03:30:28,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {3246#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {3246#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} is VALID [2022-02-21 03:30:28,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {3246#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {3246#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} is VALID [2022-02-21 03:30:28,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {3246#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2955#(or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|)))) unseeded)} is VALID [2022-02-21 03:30:28,528 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:30:28,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,535 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:30:28,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,535 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:30:28,535 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,563 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Result 55 states and 61 transitions. Complement of second has 5 states. [2022-02-21 03:30:28,564 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:30:28,564 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:28,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. cyclomatic complexity: 10 [2022-02-21 03:30:28,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:28,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:28,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:30:28,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:28,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:28,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 61 transitions. [2022-02-21 03:30:28,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:28,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:28,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:28,566 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 52 transitions. cyclomatic complexity: 10 [2022-02-21 03:30:28,566 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:28,566 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:30:28,567 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:28,568 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 61 transitions. cyclomatic complexity: 11 [2022-02-21 03:30:28,568 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:28,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:30:28,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:30:28,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:30:28,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:30:28,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:30:28,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:30:28,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:30:28,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:30:28,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:30:28,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 61 transitions. cyclomatic complexity: 11 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,577 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 03:30:28,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,578 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:28,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:28,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {2722#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2722#unseeded} is VALID [2022-02-21 03:30:28,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {2722#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~ret13#1, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~out_len~0#1, main_~out~0#1.base, main_~out~0#1.offset;main_~in_len~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {2722#unseeded} assume !(main_~in_len~0#1 < 1);call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call write~int(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {2722#unseeded} assume !(main_~out_len~0#1 < 1);call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~out~0#1.base, main_~out~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call write~int(0, main_~out~0#1.base, main_~out~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strcspn } true;strcspn_#in~s#1.base, strcspn_#in~s#1.offset, strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset := main_~in~0#1.base, main_~in~0#1.offset, main_~out~0#1.base, main_~out~0#1.offset;havoc strcspn_#res#1;havoc strcspn_#t~mem4#1, strcspn_#t~mem5#1, strcspn_#t~pre3#1, strcspn_#t~mem6#1, strcspn_#t~pre7#1, strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset, strcspn_#t~mem8#1, strcspn_~s#1.base, strcspn_~s#1.offset, strcspn_~reject#1.base, strcspn_~reject#1.offset, strcspn_~l~0#1, strcspn_~i~0#1;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_#in~s#1.base, strcspn_#in~s#1.offset;strcspn_~reject#1.base, strcspn_~reject#1.offset := strcspn_#in~reject#1.base, strcspn_#in~reject#1.offset;strcspn_~l~0#1 := 0;havoc strcspn_~i~0#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,722 INFO L290 TraceCheckUtils]: 4: Hoare triple {2722#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2722#unseeded} is VALID [2022-02-21 03:30:28,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {2722#unseeded} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {2722#unseeded} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {2722#unseeded} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {2722#unseeded} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {2722#unseeded} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2722#unseeded} is VALID [2022-02-21 03:30:28,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {2722#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2722#unseeded} is VALID [2022-02-21 03:30:28,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {2722#unseeded} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {2722#unseeded} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {2722#unseeded} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {2722#unseeded} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {2722#unseeded} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2722#unseeded} is VALID [2022-02-21 03:30:28,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {2722#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2722#unseeded} is VALID [2022-02-21 03:30:28,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {2722#unseeded} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {2722#unseeded} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {2722#unseeded} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {2722#unseeded} assume !(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {2722#unseeded} strcspn_#t~pre7#1 := 1 + strcspn_~l~0#1;strcspn_~l~0#1 := 1 + strcspn_~l~0#1;havoc strcspn_#t~pre7#1; {2722#unseeded} is VALID [2022-02-21 03:30:28,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {2722#unseeded} strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;strcspn_~s#1.base, strcspn_~s#1.offset := strcspn_~s#1.base, 1 + strcspn_~s#1.offset;havoc strcspn_#t~pre2#1.base, strcspn_#t~pre2#1.offset; {2722#unseeded} is VALID [2022-02-21 03:30:28,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {2722#unseeded} call strcspn_#t~mem8#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1); {2722#unseeded} is VALID [2022-02-21 03:30:28,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {2722#unseeded} assume !!(0 != strcspn_#t~mem8#1);havoc strcspn_#t~mem8#1;strcspn_~i~0#1 := 0; {2722#unseeded} is VALID [2022-02-21 03:30:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:30:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:28,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:28,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {2725#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|)))} call strcspn_#t~mem6#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {3427#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} is VALID [2022-02-21 03:30:28,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {3427#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} assume !!(0 != strcspn_#t~mem6#1);havoc strcspn_#t~mem6#1;call strcspn_#t~mem4#1 := read~int(strcspn_~s#1.base, strcspn_~s#1.offset, 1);call strcspn_#t~mem5#1 := read~int(strcspn_~reject#1.base, strcspn_~reject#1.offset + strcspn_~i~0#1, 1); {3427#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} is VALID [2022-02-21 03:30:28,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {3427#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} assume !(strcspn_#t~mem4#1 == strcspn_#t~mem5#1);havoc strcspn_#t~mem4#1;havoc strcspn_#t~mem5#1; {3427#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} is VALID [2022-02-21 03:30:28,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {3427#(and (<= (+ |ULTIMATE.start_strcspn_~i~0#1| |ULTIMATE.start_strcspn_~reject#1.offset| 1) (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|))))} strcspn_#t~pre3#1 := 1 + strcspn_~i~0#1;strcspn_~i~0#1 := 1 + strcspn_~i~0#1;havoc strcspn_#t~pre3#1; {2955#(or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_strcspn_~reject#1.base|) (* (- 1) |ULTIMATE.start_strcspn_~reject#1.offset|) (* (- 1) |ULTIMATE.start_strcspn_~i~0#1|)))) unseeded)} is VALID [2022-02-21 03:30:28,790 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:30:28,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,798 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:30:28,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,799 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:30:28,799 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,832 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Result 80 states and 91 transitions. Complement of second has 4 states. [2022-02-21 03:30:28,832 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:30:28,833 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:28,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. cyclomatic complexity: 10 [2022-02-21 03:30:28,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:28,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:28,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:30:28,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:28,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:28,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 91 transitions. [2022-02-21 03:30:28,834 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:28,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:28,835 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 52 transitions. cyclomatic complexity: 10 [2022-02-21 03:30:28,835 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:30:28,835 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:30:28,835 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:28,836 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 80 states and 91 transitions. cyclomatic complexity: 16 [2022-02-21 03:30:28,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 91 transitions. cyclomatic complexity: 16 [2022-02-21 03:30:28,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:28,836 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:30:28,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 80 states and 91 transitions. cyclomatic complexity: 16 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 80 states and 91 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 80 letters. Loop has 80 letters. [2022-02-21 03:30:28,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 80 letters. Loop has 80 letters. [2022-02-21 03:30:28,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 80 states and 91 transitions. cyclomatic complexity: 16 Stem has 80 letters. Loop has 80 letters. [2022-02-21 03:30:28,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:30:28,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:30:28,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 80 states and 91 transitions. cyclomatic complexity: 16 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:30:28,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:30:28,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:30:28,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 80 states and 91 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:30:28,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 80 states and 91 transitions. cyclomatic complexity: 16 Stem has 38 letters. Loop has 4 letters. [2022-02-21 03:30:28,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 80 states and 91 transitions. cyclomatic complexity: 16 Stem has 39 letters. Loop has 4 letters. [2022-02-21 03:30:28,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 80 states and 91 transitions. cyclomatic complexity: 16 Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 80 states and 91 transitions. cyclomatic complexity: 16 Stem has 37 letters. Loop has 4 letters. [2022-02-21 03:30:28,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 52 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 80 states and 91 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:30:28,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,842 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:30:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-02-21 03:30:28,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 36 letters. Loop has 4 letters. [2022-02-21 03:30:28,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 40 letters. Loop has 4 letters. [2022-02-21 03:30:28,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 36 letters. Loop has 8 letters. [2022-02-21 03:30:28,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:28,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 91 transitions. cyclomatic complexity: 16 [2022-02-21 03:30:28,847 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:28,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 0 states and 0 transitions. [2022-02-21 03:30:28,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:30:28,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:30:28,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:30:28,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:30:28,847 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:30:28,847 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:30:28,847 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:30:28,847 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:30:28,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:30:28,847 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:28,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:28,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:30:28 BoogieIcfgContainer [2022-02-21 03:30:28,852 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:30:28,852 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:30:28,852 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:30:28,853 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:30:28,853 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:03" (3/4) ... [2022-02-21 03:30:28,855 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:30:28,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:30:28,856 INFO L158 Benchmark]: Toolchain (without parser) took 26362.09ms. Allocated memory was 115.3MB in the beginning and 388.0MB in the end (delta: 272.6MB). Free memory was 94.0MB in the beginning and 264.9MB in the end (delta: -171.0MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB. [2022-02-21 03:30:28,856 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 83.9MB. Free memory was 57.6MB in the beginning and 57.5MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:30:28,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.59ms. Allocated memory is still 115.3MB. Free memory was 93.8MB in the beginning and 79.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-02-21 03:30:28,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.87ms. Allocated memory is still 115.3MB. Free memory was 78.8MB in the beginning and 77.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:30:28,857 INFO L158 Benchmark]: Boogie Preprocessor took 41.01ms. Allocated memory is still 115.3MB. Free memory was 77.3MB in the beginning and 75.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:30:28,857 INFO L158 Benchmark]: RCFGBuilder took 437.59ms. Allocated memory is still 115.3MB. Free memory was 75.8MB in the beginning and 82.7MB in the end (delta: -6.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:30:28,858 INFO L158 Benchmark]: BuchiAutomizer took 25560.95ms. Allocated memory was 115.3MB in the beginning and 388.0MB in the end (delta: 272.6MB). Free memory was 82.7MB in the beginning and 264.9MB in the end (delta: -182.3MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2022-02-21 03:30:28,858 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 388.0MB. Free memory is still 264.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:30:28,859 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.09ms. Allocated memory is still 83.9MB. Free memory was 57.6MB in the beginning and 57.5MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.59ms. Allocated memory is still 115.3MB. Free memory was 93.8MB in the beginning and 79.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.87ms. Allocated memory is still 115.3MB. Free memory was 78.8MB in the beginning and 77.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.01ms. Allocated memory is still 115.3MB. Free memory was 77.3MB in the beginning and 75.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 437.59ms. Allocated memory is still 115.3MB. Free memory was 75.8MB in the beginning and 82.7MB in the end (delta: -6.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 25560.95ms. Allocated memory was 115.3MB in the beginning and 388.0MB in the end (delta: 272.6MB). Free memory was 82.7MB in the beginning and 264.9MB in the end (delta: -182.3MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 388.0MB. Free memory is still 264.9MB. 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 7 terminating modules (2 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[reject] + -1 * reject + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 3 * unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 8 locations. One nondeterministic module has affine ranking function 5 * unknown-#length-unknown[reject] + -2 * i and consists of 9 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[reject] + -1 * reject + -1 * i and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 25.5s and 8 iterations. TraceHistogramMax:6. Analysis of lassos took 20.7s. Construction of modules took 0.2s. Büchi inclusion checks took 4.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 357 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 357 mSDsluCounter, 316 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 174 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 239 IncrementalHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 142 mSDtfsCounter, 239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital265 mio100 ax100 hnf100 lsp95 ukn78 mio100 lsp42 div100 bol100 ite100 ukn100 eq183 hnf89 smp95 dnf1998 smp67 tf100 neg89 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:30:28,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-02-21 03:30:29,119 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