./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrpbrk_malloc.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-15/cstrpbrk_malloc.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 8edf581f64d166b4408dcbe4d1c200d90abc56f787561a55f3b270257b320de9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:20,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:20,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:20,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:20,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:20,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:20,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:20,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:20,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:20,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:20,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:20,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:20,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:20,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:20,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:20,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:20,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:20,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:20,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:20,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:20,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:20,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:20,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:20,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:20,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:20,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:20,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:20,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:20,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:20,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:20,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:20,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:20,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:20,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:20,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:20,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:20,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:20,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:20,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:20,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:20,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:20,344 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:35:20,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:20,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:20,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:20,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:20,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:20,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:20,369 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:20,369 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:20,369 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:20,370 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:20,370 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:20,370 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:20,370 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:20,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:20,371 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:20,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:20,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:20,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:20,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:20,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:20,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:20,372 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:20,372 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:20,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:20,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:20,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:20,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:20,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:20,373 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:20,373 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 -> 8edf581f64d166b4408dcbe4d1c200d90abc56f787561a55f3b270257b320de9 [2022-02-21 03:35:20,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:20,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:20,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:20,602 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:20,602 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:20,603 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrpbrk_malloc.i [2022-02-21 03:35:20,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3a88cf4/ee39051d5bc246c0b4c74032af94e947/FLAGfb2c9330f [2022-02-21 03:35:21,015 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:21,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrpbrk_malloc.i [2022-02-21 03:35:21,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3a88cf4/ee39051d5bc246c0b4c74032af94e947/FLAGfb2c9330f [2022-02-21 03:35:21,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3a88cf4/ee39051d5bc246c0b4c74032af94e947 [2022-02-21 03:35:21,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:21,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:21,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:21,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:21,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:21,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5ffd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21, skipping insertion in model container [2022-02-21 03:35:21,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:21,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:21,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:21,664 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:21,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:21,756 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:21,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21 WrapperNode [2022-02-21 03:35:21,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:21,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:21,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:21,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:21,762 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:35:21" (1/1) ... [2022-02-21 03:35:21,773 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:35:21" (1/1) ... [2022-02-21 03:35:21,805 INFO L137 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2022-02-21 03:35:21,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:21,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:21,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:21,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:21,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:21,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:21,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:21,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:21,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (1/1) ... [2022-02-21 03:35:21,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:21,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:21,881 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:35:21,897 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:35:21,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:21,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:21,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:21,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:21,990 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:21,993 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:22,184 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:22,193 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:22,194 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:35:22,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:22 BoogieIcfgContainer [2022-02-21 03:35:22,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:22,196 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:22,197 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:22,199 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:22,199 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:22,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:21" (1/3) ... [2022-02-21 03:35:22,201 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1421220c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:22, skipping insertion in model container [2022-02-21 03:35:22,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:22,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:21" (2/3) ... [2022-02-21 03:35:22,201 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1421220c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:22, skipping insertion in model container [2022-02-21 03:35:22,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:22,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:22" (3/3) ... [2022-02-21 03:35:22,202 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_malloc.i [2022-02-21 03:35:22,239 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:22,240 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:22,240 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:22,240 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:22,240 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:22,240 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:22,240 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:22,240 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:22,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:22,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:22,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:22,274 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:22,274 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:22,275 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:22,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:22,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:22,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:22,278 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:22,278 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:22,282 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 17#L382true assume !(main_~length1~0#1 < 1); 14#L382-2true assume !(main_~length2~0#1 < 1); 5#L385-1true call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 9#L369-4true [2022-02-21 03:35:22,283 INFO L793 eck$LassoCheckResult]: Loop: 9#L369-4true call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 16#L369-1true assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 7#L372-5true assume !true; 6#L372-6true call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 18#L374true assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; 10#L369-3true cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; 9#L369-4true [2022-02-21 03:35:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:35:22,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485010531] [2022-02-21 03:35:22,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,413 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,453 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2022-02-21 03:35:22,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027695960] [2022-02-21 03:35:22,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:22,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {24#true} is VALID [2022-02-21 03:35:22,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {24#true} is VALID [2022-02-21 03:35:22,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-02-21 03:35:22,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {25#false} is VALID [2022-02-21 03:35:22,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {25#false} is VALID [2022-02-21 03:35:22,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {25#false} is VALID [2022-02-21 03:35:22,511 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:35:22,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:22,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027695960] [2022-02-21 03:35:22,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027695960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:22,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:22,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:35:22,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651668073] [2022-02-21 03:35:22,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:22,517 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:22,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:22,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:35:22,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:35:22,540 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,562 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:35:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:35:22,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:22,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:22,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2022-02-21 03:35:22,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:22,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2022-02-21 03:35:22,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:35:22,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:35:22,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 03:35:22,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:22,584 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 03:35:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:35:22,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:22,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:22,600 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:22,601 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,601 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:35:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:22,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:22,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:22,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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 13 states and 17 transitions. [2022-02-21 03:35:22,602 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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 13 states and 17 transitions. [2022-02-21 03:35:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:22,603 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:35:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:22,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:22,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:22,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:22,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 03:35:22,605 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:22,605 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:35:22,605 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:22,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:35:22,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:35:22,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:22,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:22,606 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:22,606 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:22,606 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~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 52#L382 assume !(main_~length1~0#1 < 1); 56#L382-2 assume !(main_~length2~0#1 < 1); 46#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 47#L369-4 [2022-02-21 03:35:22,606 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 53#L369-1 assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 50#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; 51#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 55#L372-3 assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; 48#L372-6 call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 49#L374 assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; 54#L369-3 cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; 47#L369-4 [2022-02-21 03:35:22,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,607 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2022-02-21 03:35:22,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232373699] [2022-02-21 03:35:22,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,636 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2022-02-21 03:35:22,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542003415] [2022-02-21 03:35:22,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,690 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:22,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:22,690 INFO L85 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2022-02-21 03:35:22,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:22,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196516538] [2022-02-21 03:35:22,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:22,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,758 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:22,782 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:23,430 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:23,431 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:23,431 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:23,431 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:23,431 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:23,431 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,431 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:23,431 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:23,431 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration2_Lasso [2022-02-21 03:35:23,431 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:23,431 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:23,452 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:35:23,457 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:35:23,460 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:35:23,462 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:35:23,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:23,466 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:35:23,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:23,470 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:35:23,471 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:35:23,473 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:35:23,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:23,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:23,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:35:23,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:35:23,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:35:23,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:35:23,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:35:23,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:35:23,850 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:35:23,852 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:35:23,854 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:35:23,855 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:35:23,857 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:35:23,859 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:35:24,605 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:24,612 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:24,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,614 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:35:24,616 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:35:24,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:24,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:24,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:24,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:24,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:24,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:24,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:24,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:24,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:24,653 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:35:24,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,654 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:35:24,655 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:35:24,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:24,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:24,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:24,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:24,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:24,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:24,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:24,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:24,684 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:35:24,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,685 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:35:24,686 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:35:24,688 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:35:24,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:24,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:24,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:24,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:24,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:24,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:24,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:24,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:24,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:24,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,723 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:35:24,724 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:35:24,725 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:35:24,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:24,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:24,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:24,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:24,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:24,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:24,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:24,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:24,766 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:35:24,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,767 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:35:24,769 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:35:24,769 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:35:24,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:24,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:24,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:24,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:24,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:24,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:24,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:24,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:24,805 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:35:24,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,806 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:35:24,806 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:35:24,808 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:35:24,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:24,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:24,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:24,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:24,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:24,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:24,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:24,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:24,846 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:35:24,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,847 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:35:24,848 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:35:24,849 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:35:24,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:24,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:24,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:24,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:24,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:24,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:24,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:24,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:24,883 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:35:24,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,887 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:35:24,887 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:35:24,888 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:35:24,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:24,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:24,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:24,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:24,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:24,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:24,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:24,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:24,921 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:35:24,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,922 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:35:24,923 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:35:24,924 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:35:24,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:24,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:24,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:24,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:24,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:24,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:24,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:24,961 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:35:24,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:24,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:24,962 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:35:24,980 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:35:24,980 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:35:24,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:24,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:24,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:24,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:24,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:24,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:24,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,020 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:35:25,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,021 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:35:25,022 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:35:25,024 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:35:25,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:25,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,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:35:25,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:35:25,064 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:35:25,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,102 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:35:25,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,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:35:25,104 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:35:25,106 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:35:25,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,148 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:35:25,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,149 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:35:25,150 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:35:25,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:25,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,179 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:35:25,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,183 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:35:25,183 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:35:25,185 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:35:25,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:25,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,193 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:35:25,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,195 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:35:25,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:25,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:25,215 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:35:25,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,216 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:35:25,221 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:35:25,221 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:35:25,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:25,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:25,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:25,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:25,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:25,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:25,249 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:25,285 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 03:35:25,285 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-02-21 03:35:25,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:25,319 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:35:25,363 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:35:25,363 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:25,384 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:25,384 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:25,385 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0#1.offset Supporting invariants [] [2022-02-21 03:35:25,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:35:25,424 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 03:35:25,440 INFO L390 LassoCheck]: Loop: "call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);" "assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1;" "call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1;" "assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;" "call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);" "assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1;" "cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset;" [2022-02-21 03:35:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:25,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {92#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {92#unseeded} is VALID [2022-02-21 03:35:25,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {92#unseeded} is VALID [2022-02-21 03:35:25,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:35:25,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0#1 < 1); {92#unseeded} is VALID [2022-02-21 03:35:25,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {92#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {136#(and unseeded (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 03:35:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:25,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:25,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 03:35:25,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 03:35:25,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 03:35:25,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 03:35:25,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 03:35:25,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 03:35:25,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 03:35:25,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#(and (<= (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {139#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|)))) unseeded) (= |ULTIMATE.start_cstrpbrk_~sc1~0#1.base| |ULTIMATE.start_main_~nondetString1~0#1.base|))} is VALID [2022-02-21 03:35:25,642 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:35:25,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:25,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:25,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:25,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,656 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:35:25,657 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:25,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 28 transitions. Complement of second has 4 states. [2022-02-21 03:35:25,717 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:35:25,717 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:25,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:25,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:25,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:25,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:25,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:25,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:25,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:25,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-02-21 03:35:25,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:25,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:25,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:25,722 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:25,723 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:35:25,723 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:25,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:25,724 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:25,725 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:25,725 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:25,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:25,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:25,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:25,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:25,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:25,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:25,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:25,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:25,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:25,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:25,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:25,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:35:25,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:25,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:25,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:35:25,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:25,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:25,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:35:25,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:35:25,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:35:25,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 8 letters. [2022-02-21 03:35:25,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:35:25,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:35:25,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:35:25,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:25,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:25,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:25,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:25,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:25,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:25,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:35:25,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:35:25,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 8 letters. [2022-02-21 03:35:25,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:35:25,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:35:25,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 8 letters. [2022-02-21 03:35:25,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:25,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:25,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:25,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:25,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:25,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:25,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:25,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:25,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:25,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:25,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:25,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:25,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:25,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:25,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:25,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:25,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:25,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:25,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,739 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:35:25,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:35:25,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2022-02-21 03:35:25,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:25,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:25,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:25,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:25,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2022-02-21 03:35:25,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:35:25,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:35:25,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-02-21 03:35:25,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:25,744 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-02-21 03:35:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 03:35:25,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:25,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:25,745 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:25,746 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:25,746 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:25,748 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:25,748 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:25,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:25,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:25,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 25 transitions. [2022-02-21 03:35:25,749 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 25 transitions. [2022-02-21 03:35:25,749 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:25,750 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 03:35:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:25,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:25,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:25,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:25,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 03:35:25,752 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:25,752 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 03:35:25,752 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:25,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 03:35:25,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:25,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:25,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:25,753 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:25,754 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:25,754 INFO L791 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 208#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 217#L382 assume !(main_~length1~0#1 < 1); 224#L382-2 assume !(main_~length2~0#1 < 1); 209#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 210#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 219#L369-1 assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 213#L372-5 [2022-02-21 03:35:25,754 INFO L793 eck$LassoCheckResult]: Loop: 213#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; 214#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 222#L372-3 assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; 213#L372-5 [2022-02-21 03:35:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2022-02-21 03:35:25,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:25,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676644320] [2022-02-21 03:35:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:25,772 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:25,799 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:25,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:25,802 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2022-02-21 03:35:25,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:25,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15174442] [2022-02-21 03:35:25,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:25,812 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:25,816 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:25,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:25,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2022-02-21 03:35:25,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:25,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249883663] [2022-02-21 03:35:25,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:25,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:25,835 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:25,849 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:25,903 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:35:26,307 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:26,307 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:26,307 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:26,307 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:26,307 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:26,307 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:26,307 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:26,307 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:26,307 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration3_Lasso [2022-02-21 03:35:26,307 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:26,307 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:26,309 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:35:26,311 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:35:26,312 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:35:26,314 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:35:26,315 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:35:26,316 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:35:26,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:26,320 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:35:26,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:26,322 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:35:26,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:26,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:26,674 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:35:26,677 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:35:26,679 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:35:26,681 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:35:26,682 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:35:26,684 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:35:26,686 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:35:26,688 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:35:26,690 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:35:26,692 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:35:26,694 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:35:26,696 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:35:27,461 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:27,461 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:27,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,464 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:35:27,465 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:35:27,466 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:35:27,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 03:35:27,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,504 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:35:27,509 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:35:27,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,519 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:35:27,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,547 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:35:27,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,548 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:35:27,550 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:35:27,551 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:35:27,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 03:35:27,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,576 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:35:27,576 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:35:27,578 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:35:27,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:27,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,604 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:35:27,604 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:35:27,639 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:35:27,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:35:27,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,672 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:35:27,673 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:35:27,674 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:35:27,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:27,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:27,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,711 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:35:27,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,713 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:35:27,714 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:35:27,715 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:35:27,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,750 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:35:27,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,753 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:35:27,754 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:35:27,801 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:35:27,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,828 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:35:27,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,829 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:35:27,830 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:35:27,831 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:35:27,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:35:27,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,860 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:35:27,860 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:35:27,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:35:27,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,899 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:35:27,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,901 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:35:27,901 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:35:27,903 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:35:27,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:27,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:27,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:27,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:35:27,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,940 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:35:27,941 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:35:27,943 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:35:27,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:27,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:27,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:27,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:35:27,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:27,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:27,982 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:35:27,983 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:35:27,985 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:35:27,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:27,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:27,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:27,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:27,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:27,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:28,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:28,033 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:35:28,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,035 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:28,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:35:28,037 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:35:28,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:28,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:28,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:28,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:28,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:28,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:28,065 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:28,082 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-02-21 03:35:28,082 INFO L444 ModelExtractionUtils]: 26 out of 37 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 03:35:28,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:28,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:28,084 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:35:28,085 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:35:28,086 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:28,107 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:28,107 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:28,107 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0#1.offset, v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_2 Supporting invariants [] [2022-02-21 03:35:28,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:28,157 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2022-02-21 03:35:28,162 INFO L390 LassoCheck]: Loop: "call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1;" "assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset;" [2022-02-21 03:35:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:28,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {314#unseeded} is VALID [2022-02-21 03:35:28,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {314#unseeded} is VALID [2022-02-21 03:35:28,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#unseeded} assume !(main_~length1~0#1 < 1); {314#unseeded} is VALID [2022-02-21 03:35:28,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {314#unseeded} assume !(main_~length2~0#1 < 1); {314#unseeded} is VALID [2022-02-21 03:35:28,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {314#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {399#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:28,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {399#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:28,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {399#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {378#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:35:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:28,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {379#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {406#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:28,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {406#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:28,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; {381#(and (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded))} is VALID [2022-02-21 03:35:28,278 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:35:28,279 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:35:28,287 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:35:28,287 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 3 letters. [2022-02-21 03:35:28,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,288 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:35:28,288 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 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:35:28,349 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. 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 43 states and 57 transitions. Complement of second has 6 states. [2022-02-21 03:35:28,349 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:35:28,349 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:28,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:28,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:28,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:28,349 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:35:28,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:28,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:28,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:28,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2022-02-21 03:35:28,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:28,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:28,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:28,351 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2022-02-21 03:35:28,351 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:28,352 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:35:28,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:28,352 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:28,352 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:28,353 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:28,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:28,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,353 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 3 letters. [2022-02-21 03:35:28,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:28,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:28,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,353 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:35:28,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:28,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:28,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,353 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 15 letters. Loop has 3 letters. [2022-02-21 03:35:28,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:35:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,354 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 43 letters. Loop has 43 letters. [2022-02-21 03:35:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:35:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,354 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 18 letters. Loop has 18 letters. [2022-02-21 03:35:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,354 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:35:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,355 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 3 letters. [2022-02-21 03:35:28,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:28,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:28,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,355 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 3 letters. [2022-02-21 03:35:28,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:28,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:28,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,355 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 3 letters. [2022-02-21 03:35:28,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:28,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:28,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,356 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:35:28,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:28,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:28,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,356 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 15 letters. Loop has 3 letters. [2022-02-21 03:35:28,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:28,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:28,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,356 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 16 letters. Loop has 3 letters. [2022-02-21 03:35:28,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:28,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:28,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,358 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 17 letters. Loop has 3 letters. [2022-02-21 03:35:28,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:28,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,358 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:28,358 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:35:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:28,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:28,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:28,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:35:28,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:28,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2022-02-21 03:35:28,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:28,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2022-02-21 03:35:28,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:35:28,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:35:28,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2022-02-21 03:35:28,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:28,361 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-21 03:35:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2022-02-21 03:35:28,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-02-21 03:35:28,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:28,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 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:35:28,362 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 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:35:28,363 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 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:35:28,363 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:28,364 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:35:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:28,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:28,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:28,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 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 30 states and 40 transitions. [2022-02-21 03:35:28,364 INFO L87 Difference]: Start difference. First operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 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 30 states and 40 transitions. [2022-02-21 03:35:28,364 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:28,366 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-21 03:35:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:28,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:28,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:28,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:28,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.375) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 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:35:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-02-21 03:35:28,369 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:35:28,369 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-02-21 03:35:28,369 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:35:28,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2022-02-21 03:35:28,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:28,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:28,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:28,371 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:28,371 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:28,371 INFO L791 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 467#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 476#L382 assume !(main_~length1~0#1 < 1); 485#L382-2 assume !(main_~length2~0#1 < 1); 468#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 469#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 477#L369-1 assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 486#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; 489#L372-1 assume !cstrpbrk_#t~short210#1; 487#L372-3 assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; 470#L372-6 call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 471#L374 assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; 481#L369-3 cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; 478#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 480#L369-1 assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 472#L372-5 [2022-02-21 03:35:28,371 INFO L793 eck$LassoCheckResult]: Loop: 472#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; 473#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 482#L372-3 assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; 472#L372-5 [2022-02-21 03:35:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2022-02-21 03:35:28,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:28,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795039583] [2022-02-21 03:35:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:28,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {614#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {614#true} is VALID [2022-02-21 03:35:28,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {614#true} is VALID [2022-02-21 03:35:28,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {614#true} assume !(main_~length1~0#1 < 1); {614#true} is VALID [2022-02-21 03:35:28,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {614#true} assume !(main_~length2~0#1 < 1); {614#true} is VALID [2022-02-21 03:35:28,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {614#true} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {614#true} is VALID [2022-02-21 03:35:28,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {614#true} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {616#(= |ULTIMATE.start_cstrpbrk_#t~mem206#1| (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))} is VALID [2022-02-21 03:35:28,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {616#(= |ULTIMATE.start_cstrpbrk_#t~mem206#1| (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|))} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {617#(not (= 0 |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 03:35:28,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {617#(not (= 0 |ULTIMATE.start_cstrpbrk_~c~0#1|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {618#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|)) |ULTIMATE.start_cstrpbrk_#t~short210#1|)} is VALID [2022-02-21 03:35:28,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {618#(or (not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|)) |ULTIMATE.start_cstrpbrk_#t~short210#1|)} assume !cstrpbrk_#t~short210#1; {619#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 03:35:28,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {619#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {619#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 03:35:28,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {619#(not (= (select (select |#memory_int| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) |ULTIMATE.start_cstrpbrk_~c~0#1|))} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {620#(not (= |ULTIMATE.start_cstrpbrk_#t~mem212#1| |ULTIMATE.start_cstrpbrk_~c~0#1|))} is VALID [2022-02-21 03:35:28,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {620#(not (= |ULTIMATE.start_cstrpbrk_#t~mem212#1| |ULTIMATE.start_cstrpbrk_~c~0#1|))} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {615#false} is VALID [2022-02-21 03:35:28,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {615#false} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {615#false} is VALID [2022-02-21 03:35:28,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {615#false} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {615#false} is VALID [2022-02-21 03:35:28,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#false} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {615#false} is VALID [2022-02-21 03:35:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:28,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:28,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795039583] [2022-02-21 03:35:28,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795039583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:28,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:28,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:35:28,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935079085] [2022-02-21 03:35:28,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:28,450 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:35:28,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:28,450 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2022-02-21 03:35:28,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:28,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26006218] [2022-02-21 03:35:28,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:28,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:28,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:28,458 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:28,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:28,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:35:28,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:35:28,544 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:28,580 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:35:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:28,705 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-21 03:35:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:35:28,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:28,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:28,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2022-02-21 03:35:28,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:35:28,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2022-02-21 03:35:28,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:35:28,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:35:28,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2022-02-21 03:35:28,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:28,732 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-02-21 03:35:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2022-02-21 03:35:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-02-21 03:35:28,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:28,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 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:35:28,733 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 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:35:28,733 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 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:35:28,733 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:28,734 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 03:35:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:35:28,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:28,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:28,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 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 27 states and 35 transitions. [2022-02-21 03:35:28,735 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 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 27 states and 35 transitions. [2022-02-21 03:35:28,735 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:28,736 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-02-21 03:35:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-21 03:35:28,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:28,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:28,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:28,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 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:35:28,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-21 03:35:28,737 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 03:35:28,737 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-21 03:35:28,737 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:35:28,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2022-02-21 03:35:28,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:28,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:28,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:28,737 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:28,737 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:28,738 INFO L791 eck$LassoCheckResult]: Stem: 661#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 662#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; 671#L382 assume !(main_~length1~0#1 < 1); 680#L382-2 assume !(main_~length2~0#1 < 1); 663#L385-1 call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 664#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 672#L369-1 assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 685#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; 684#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 682#L372-3 assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; 665#L372-6 call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 666#L374 assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; 676#L369-3 cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; 673#L369-4 call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 674#L369-1 assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; 667#L372-5 [2022-02-21 03:35:28,738 INFO L793 eck$LassoCheckResult]: Loop: 667#L372-5 call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; 668#L372-1 assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 677#L372-3 assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; 667#L372-5 [2022-02-21 03:35:28,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:28,738 INFO L85 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2022-02-21 03:35:28,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:28,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211650876] [2022-02-21 03:35:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:28,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:28,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:28,766 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:28,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:28,766 INFO L85 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2022-02-21 03:35:28,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:28,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305088171] [2022-02-21 03:35:28,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:28,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:28,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:28,779 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2022-02-21 03:35:28,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:28,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859103236] [2022-02-21 03:35:28,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:28,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:28,798 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:28,811 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:29,672 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:29,672 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:29,672 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:29,672 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:29,672 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:29,672 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:29,672 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:29,672 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:29,672 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration5_Lasso [2022-02-21 03:35:29,672 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:29,673 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:29,675 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:35:29,681 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:35:29,683 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:35:29,685 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:35:29,687 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:35:29,688 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:35:29,690 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:35:29,691 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:35:29,693 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:35:29,708 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:35:29,709 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:35:29,711 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:35:29,713 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:35:29,714 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:35:29,716 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:35:29,717 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:35:29,722 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:35:30,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:30,251 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:35:30,267 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:35:30,269 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:35:30,271 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:35:30,273 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:35:31,360 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:31,360 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:31,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,361 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:35:31,367 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:35:31,367 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:35:31,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:31,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:31,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:35:31,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,394 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:35:31,395 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:35:31,396 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:35:31,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 03:35:31,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,418 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:35:31,419 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:35:31,420 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:35:31,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,441 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:35:31,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,442 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:35:31,443 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:35:31,444 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:35:31,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:31,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,467 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:35:31,467 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:35:31,469 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:35:31,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,504 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:35:31,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,505 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:35:31,506 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:35:31,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:31,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,544 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:35:31,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,545 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:35:31,548 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:35:31,548 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:35:31,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 03:35:31,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,570 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:35:31,573 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:35:31,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,584 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:35:31,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:31,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,605 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:35:31,605 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:35:31,607 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:35:31,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,639 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:35:31,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,640 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:35:31,641 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:35:31,642 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:35:31,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,665 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:35:31,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,666 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:35:31,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:35:31,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,675 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:35:31,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:35:31,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,701 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:35:31,701 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:35:31,704 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:35:31,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:31,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:31,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,728 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:35:31,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,729 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:35:31,730 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:35:31,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:35:31,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:31,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,756 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:35:31,756 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:35:31,758 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:35:31,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 03:35:31,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,782 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:35:31,783 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:35:31,785 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:35:31,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 03:35:31,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,808 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:35:31,809 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:35:31,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:31,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:31,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:31,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:31,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 03:35:31,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,846 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:35:31,852 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:35:31,852 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:35:31,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:31,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:31,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:31,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:31,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:31,883 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:35:31,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:31,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:31,885 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:35:31,885 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:35:31,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:31,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:31,893 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:35:31,893 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-02-21 03:35:31,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:31,956 INFO L401 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2022-02-21 03:35:31,956 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-02-21 03:35:32,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:32,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 03:35:32,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:32,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:32,095 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:35:32,095 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:35:32,096 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:35:32,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:32,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:32,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:32,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:32,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:32,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:32,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:32,120 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:35:32,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:32,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:32,121 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:35:32,121 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:35:32,123 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:35:32,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:32,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:32,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:32,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:32,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:32,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:32,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:32,148 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:35:32,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:32,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:32,149 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:35:32,150 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:35:32,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:32,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:32,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:32,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:32,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:32,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:32,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:32,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:32,183 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:35:32,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:32,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:32,184 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:35:32,185 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:35:32,186 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:35:32,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:32,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:32,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:32,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:32,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:32,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:32,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:32,224 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-02-21 03:35:32,224 INFO L444 ModelExtractionUtils]: 23 out of 40 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-02-21 03:35:32,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:32,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:32,226 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:35:32,226 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:35:32,227 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:32,233 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:32,234 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:32,234 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_3, ULTIMATE.start_cstrpbrk_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_3 - 1*ULTIMATE.start_cstrpbrk_~s~0#1.offset Supporting invariants [] [2022-02-21 03:35:32,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-02-21 03:35:32,342 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:35:32,351 INFO L297 tatePredicateManager]: 19 out of 21 supporting invariants were superfluous and have been removed [2022-02-21 03:35:32,357 INFO L390 LassoCheck]: Loop: "call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1;" "assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256);" "assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset;" [2022-02-21 03:35:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:32,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {809#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {809#unseeded} is VALID [2022-02-21 03:35:32,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {809#unseeded} is VALID [2022-02-21 03:35:32,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {809#unseeded} assume !(main_~length1~0#1 < 1); {809#unseeded} is VALID [2022-02-21 03:35:32,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {809#unseeded} assume !(main_~length2~0#1 < 1); {809#unseeded} is VALID [2022-02-21 03:35:32,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {809#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {929#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|))} is VALID [2022-02-21 03:35:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:32,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {981#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:32,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {981#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:32,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {981#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; {932#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|))} is VALID [2022-02-21 03:35:32,567 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:35:32,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:32,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:32,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,582 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:35:32,582 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:32,636 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 51 transitions. Complement of second has 6 states. [2022-02-21 03:35:32,636 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:35:32,636 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:32,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:32,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:32,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:32,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:32,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:32,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:32,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:32,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:35:32,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:32,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:32,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:32,638 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:32,638 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:32,638 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:32,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:32,638 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:32,639 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:32,639 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:32,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:32,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:35:32,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:32,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:32,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:32,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:32,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:32,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:32,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:32,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:32,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:35:32,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:32,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:32,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:35:32,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:32,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:35:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:35:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:35:32,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:32,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:32,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:35:32,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:32,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,644 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:32,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,645 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:32,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {809#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {809#unseeded} is VALID [2022-02-21 03:35:32,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {809#unseeded} is VALID [2022-02-21 03:35:32,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {809#unseeded} assume !(main_~length1~0#1 < 1); {809#unseeded} is VALID [2022-02-21 03:35:32,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {809#unseeded} assume !(main_~length2~0#1 < 1); {809#unseeded} is VALID [2022-02-21 03:35:32,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {809#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {1056#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {929#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|))} is VALID [2022-02-21 03:35:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:32,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {1087#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:32,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {1087#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1087#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:32,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {1087#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; {932#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|))} is VALID [2022-02-21 03:35:32,820 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:35:32,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:32,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:32,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,831 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:35:32,831 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:32,875 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 51 transitions. Complement of second has 6 states. [2022-02-21 03:35:32,875 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:35:32,875 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:32,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:32,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:32,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:32,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:32,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:32,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:32,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:32,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:35:32,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:32,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:32,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:32,878 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:32,878 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:32,878 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:32,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:32,878 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:32,878 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:32,878 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:32,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:32,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:35:32,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:32,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:32,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:32,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:32,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:32,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:32,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:32,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:32,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:35:32,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:32,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:32,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:35:32,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:32,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:32,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:35:32,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:32,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:32,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:35:32,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:32,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:32,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:35:32,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:32,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:32,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:35:32,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:32,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,891 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:35:32,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:32,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:32,893 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:35:32,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:32,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:32,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {809#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {809#unseeded} is VALID [2022-02-21 03:35:32,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.base, main_#t~ret217#1.offset, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;main_~length1~0#1 := main_#t~nondet213#1;havoc main_#t~nondet213#1;main_~length2~0#1 := main_#t~nondet214#1;havoc main_#t~nondet214#1; {809#unseeded} is VALID [2022-02-21 03:35:32,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {809#unseeded} assume !(main_~length1~0#1 < 1); {809#unseeded} is VALID [2022-02-21 03:35:32,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {809#unseeded} assume !(main_~length2~0#1 < 1); {809#unseeded} is VALID [2022-02-21 03:35:32,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {809#unseeded} call main_#t~malloc215#1.base, main_#t~malloc215#1.offset := #Ultimate.allocOnHeap(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc215#1.base, main_#t~malloc215#1.offset;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;havoc main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem207#1, cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset, cstrpbrk_#t~mem208#1, cstrpbrk_#t~mem209#1, cstrpbrk_#t~short210#1, cstrpbrk_#t~mem212#1, cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset, cstrpbrk_#t~mem206#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1; {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem212#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !(cstrpbrk_#t~mem212#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem212#1; {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post205#1.base, 1 + cstrpbrk_#t~post205#1.offset;havoc cstrpbrk_#t~post205#1.base, cstrpbrk_#t~post205#1.offset; {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} call cstrpbrk_#t~mem206#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} is VALID [2022-02-21 03:35:32,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {1162#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded)} assume !!(0 != cstrpbrk_#t~mem206#1);havoc cstrpbrk_#t~mem206#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem207#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem207#1;havoc cstrpbrk_#t~mem207#1; {929#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) unseeded (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|))} is VALID [2022-02-21 03:35:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:33,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:35:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:33,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:33,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|))} call cstrpbrk_#t~mem208#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := 0 != cstrpbrk_#t~mem208#1; {1193#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:33,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {1193#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume cstrpbrk_#t~short210#1;call cstrpbrk_#t~mem209#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short210#1 := cstrpbrk_#t~mem209#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); {1193#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} is VALID [2022-02-21 03:35:33,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {1193#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|))) (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|)))} assume !!cstrpbrk_#t~short210#1;havoc cstrpbrk_#t~mem208#1;havoc cstrpbrk_#t~mem209#1;havoc cstrpbrk_#t~short210#1;cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post211#1.base, 1 + cstrpbrk_#t~post211#1.offset;havoc cstrpbrk_#t~post211#1.base, cstrpbrk_#t~post211#1.offset; {932#(and (= |ULTIMATE.start_cstrpbrk_~s2#1.base| |ULTIMATE.start_main_~nondetString2~0#1.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (select |#length| |ULTIMATE.start_main_~nondetString2~0#1.base|)))) unseeded) (= |ULTIMATE.start_cstrpbrk_~s~0#1.base| |ULTIMATE.start_cstrpbrk_~s2#1.base|))} is VALID [2022-02-21 03:35:33,047 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:35:33,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:33,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:33,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:33,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,058 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:35:33,058 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:33,119 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 53 transitions. Complement of second has 5 states. [2022-02-21 03:35:33,120 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:35:33,120 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:33,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:33,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:33,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:33,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:33,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:33,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:33,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:33,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2022-02-21 03:35:33,121 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:33,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:33,121 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:33,121 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:33,121 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:33,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:33,122 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:33,122 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:33,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:33,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:33,122 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:35:33,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:33,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:33,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:33,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:33,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:35:33,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:33,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:33,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:33,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:35:33,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:33,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:33,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:35:33,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:33,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:35:33,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:33,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:33,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:35:33,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:33,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:33,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:33,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:33,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:33,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 3 letters. [2022-02-21 03:35:33,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:35:33,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:33,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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:35:33,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:35:33,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,125 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:35:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-21 03:35:33,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:33,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:33,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:35:33,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:33,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2022-02-21 03:35:33,131 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:33,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2022-02-21 03:35:33,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:35:33,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:35:33,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:35:33,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:33,131 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:33,131 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:33,131 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:33,131 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:35:33,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:35:33,131 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:33,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:33,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:35:33 BoogieIcfgContainer [2022-02-21 03:35:33,140 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:35:33,140 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:35:33,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:35:33,140 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:35:33,141 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:22" (3/4) ... [2022-02-21 03:35:33,143 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:35:33,143 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:35:33,144 INFO L158 Benchmark]: Toolchain (without parser) took 11732.52ms. Allocated memory was 83.9MB in the beginning and 197.1MB in the end (delta: 113.2MB). Free memory was 44.8MB in the beginning and 66.4MB in the end (delta: -21.6MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. [2022-02-21 03:35:33,144 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:33,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.76ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 44.7MB in the beginning and 88.1MB in the end (delta: -43.4MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2022-02-21 03:35:33,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.46ms. Allocated memory is still 113.2MB. Free memory was 88.1MB in the beginning and 86.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:33,145 INFO L158 Benchmark]: Boogie Preprocessor took 47.77ms. Allocated memory is still 113.2MB. Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:33,145 INFO L158 Benchmark]: RCFGBuilder took 340.62ms. Allocated memory is still 113.2MB. Free memory was 84.4MB in the beginning and 70.3MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:35:33,145 INFO L158 Benchmark]: BuchiAutomizer took 10943.18ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 70.3MB in the beginning and 66.4MB in the end (delta: 3.9MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2022-02-21 03:35:33,145 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 197.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:33,146 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.14ms. Allocated memory is still 83.9MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.76ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 44.7MB in the beginning and 88.1MB in the end (delta: -43.4MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.46ms. Allocated memory is still 113.2MB. Free memory was 88.1MB in the beginning and 86.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.77ms. Allocated memory is still 113.2MB. Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 340.62ms. Allocated memory is still 113.2MB. Free memory was 84.4MB in the beginning and 70.3MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 10943.18ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 70.3MB in the beginning and 66.4MB in the end (delta: 3.9MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 197.1MB. Free memory is still 66.4MB. 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[nondetString1] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString2] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString2] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 9.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 185 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 105 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital259 mio100 ax100 hnf100 lsp103 ukn72 mio100 lsp30 div154 bol100 ite100 ukn100 eq155 hnf96 smp77 dnf633 smp42 tf100 neg95 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 192ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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:35:33,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE