./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncat_mixed_alloca.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/cstrncat_mixed_alloca.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 70184d4840a4a279227f01908628d096dbcef3bd5331fa48bfaba7e7591e465f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:11,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:11,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:11,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:11,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:11,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:11,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:11,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:11,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:11,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:11,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:11,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:11,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:11,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:11,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:11,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:11,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:11,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:11,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:11,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:11,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:11,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:11,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:11,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:11,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:11,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:11,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:11,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:11,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:11,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:11,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:11,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:11,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:11,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:11,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:11,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:11,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:11,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:11,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:11,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:11,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:11,348 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:11,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:11,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:11,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:11,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:11,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:11,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:11,374 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:11,374 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:11,374 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:11,374 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:11,375 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:11,375 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:11,375 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:11,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:11,376 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:11,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:11,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:11,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:11,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:11,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:11,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:11,377 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:11,377 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:11,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:11,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:11,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:11,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:11,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:11,379 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:11,379 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 -> 70184d4840a4a279227f01908628d096dbcef3bd5331fa48bfaba7e7591e465f [2022-02-21 03:35:11,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:11,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:11,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:11,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:11,614 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:11,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncat_mixed_alloca.i [2022-02-21 03:35:11,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7fb083d8/879adc93fb23486b9fe66617f3831f66/FLAGde9a5a5da [2022-02-21 03:35:12,074 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:12,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncat_mixed_alloca.i [2022-02-21 03:35:12,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7fb083d8/879adc93fb23486b9fe66617f3831f66/FLAGde9a5a5da [2022-02-21 03:35:12,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7fb083d8/879adc93fb23486b9fe66617f3831f66 [2022-02-21 03:35:12,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:12,094 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:12,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:12,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:12,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:12,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:12" (1/1) ... [2022-02-21 03:35:12,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c413b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:12, skipping insertion in model container [2022-02-21 03:35:12,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:12" (1/1) ... [2022-02-21 03:35:12,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:12,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:12,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:12,362 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:12,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:12,413 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:12,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:12 WrapperNode [2022-02-21 03:35:12,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:12,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:12,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:12,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:12,420 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:12" (1/1) ... [2022-02-21 03:35:12,437 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:12" (1/1) ... [2022-02-21 03:35:12,460 INFO L137 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2022-02-21 03:35:12,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:12,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:12,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:12,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:12,467 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:12" (1/1) ... [2022-02-21 03:35:12,467 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:12" (1/1) ... [2022-02-21 03:35:12,475 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:12" (1/1) ... [2022-02-21 03:35:12,476 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:12" (1/1) ... [2022-02-21 03:35:12,488 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:12" (1/1) ... [2022-02-21 03:35:12,490 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:12" (1/1) ... [2022-02-21 03:35:12,491 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:12" (1/1) ... [2022-02-21 03:35:12,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:12,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:12,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:12,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:12,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:12" (1/1) ... [2022-02-21 03:35:12,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:12,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:12,536 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:12,556 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:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:35:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:12,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:12,680 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:12,681 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:12,874 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:12,878 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:12,878 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:35:12,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:12 BoogieIcfgContainer [2022-02-21 03:35:12,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:12,880 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:12,880 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:12,883 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:12,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:12,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:12" (1/3) ... [2022-02-21 03:35:12,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40ca3cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:12, skipping insertion in model container [2022-02-21 03:35:12,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:12,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:12" (2/3) ... [2022-02-21 03:35:12,885 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40ca3cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:12, skipping insertion in model container [2022-02-21 03:35:12,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:12,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:12" (3/3) ... [2022-02-21 03:35:12,886 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrncat_mixed_alloca.i [2022-02-21 03:35:12,916 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:12,917 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:12,917 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:12,917 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:12,917 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:12,917 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:12,917 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:12,917 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:12,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:12,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:35:12,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:12,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:12,956 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:12,956 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:12,956 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:12,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:12,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:35:12,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:12,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:12,962 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:35:12,962 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:12,967 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~nondet215#1, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~malloc217#1.base, main_#t~malloc217#1.offset, main_#t~ret218#1.base, main_#t~ret218#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~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;main_~n~0#1 := main_#t~nondet215#1;havoc main_#t~nondet215#1; 18#L381true assume !(main_~length1~0#1 < 1); 15#L381-2true assume !(main_~length2~0#1 < 1); 13#L384-1true assume !(main_~n~0#1 < 1); 17#L387-1true assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call main_#t~malloc217#1.base, main_#t~malloc217#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc217#1.base, main_#t~malloc217#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset, cstrncat_#t~mem205#1, cstrncat_#t~post210#1, cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset, cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset, cstrncat_#t~mem208#1, cstrncat_#t~short209#1, cstrncat_#t~mem212#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; 3#L367-3true [2022-02-21 03:35:12,967 INFO L793 eck$LassoCheckResult]: Loop: 3#L367-3true call cstrncat_#t~mem205#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); 16#L367-1true assume !!(0 != cstrncat_#t~mem205#1);havoc cstrncat_#t~mem205#1;cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post206#1.base, 1 + cstrncat_#t~post206#1.offset;havoc cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset; 3#L367-3true [2022-02-21 03:35:12,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:12,971 INFO L85 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2022-02-21 03:35:12,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:12,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291499981] [2022-02-21 03:35:12,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:12,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:13,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:13,181 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:13,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:13,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2022-02-21 03:35:13,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:13,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821012781] [2022-02-21 03:35:13,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:13,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:13,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:13,213 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:13,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2022-02-21 03:35:13,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:13,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468455992] [2022-02-21 03:35:13,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:13,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:13,270 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:13,288 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:13,996 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:13,996 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:13,996 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:13,996 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:13,996 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:13,996 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:13,996 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:13,996 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:13,996 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncat_mixed_alloca.i_Iteration1_Lasso [2022-02-21 03:35:13,996 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:13,996 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:14,008 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:14,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:14,032 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:14,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:14,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:14,520 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:14,522 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:14,525 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:14,528 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:14,530 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:14,532 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:14,534 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:14,536 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:14,538 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:14,540 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:14,542 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:14,544 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:14,546 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:14,548 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:14,550 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:14,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:14,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:14,993 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:14,997 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:14,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:14,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:15,025 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:15,031 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:15,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:15,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:15,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:15,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:15,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:15,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:15,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:15,044 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:15,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:15,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:15,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:15,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:15,081 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:15,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:15,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:15,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:15,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:15,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:15,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:15,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:15,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:15,096 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:15,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:15,123 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:15,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:15,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:15,126 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:15,127 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:15,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:15,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:15,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:15,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:15,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:15,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:15,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:15,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:15,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:15,169 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:15,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:15,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:15,171 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:15,172 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:15,174 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:15,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:15,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:15,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:15,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:15,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:15,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:15,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:15,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:15,211 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:15,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:15,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:15,213 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:15,214 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:15,215 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:15,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:15,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:15,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:15,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:15,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:15,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:15,253 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:15,295 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:35:15,295 INFO L444 ModelExtractionUtils]: 30 out of 46 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-02-21 03:35:15,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:15,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:15,302 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:15,358 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:15,358 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:15,381 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:15,381 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:15,381 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncat_~s~0#1.base)_1, ULTIMATE.start_cstrncat_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncat_~s~0#1.base)_1 - 1*ULTIMATE.start_cstrncat_~s~0#1.offset Supporting invariants [] [2022-02-21 03:35:15,401 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:15,484 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:35:15,489 INFO L390 LassoCheck]: Loop: "call cstrncat_#t~mem205#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1);" "assume !!(0 != cstrncat_#t~mem205#1);havoc cstrncat_#t~mem205#1;cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post206#1.base, 1 + cstrncat_#t~post206#1.offset;havoc cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset;" [2022-02-21 03:35:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:15,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {28#unseeded} is VALID [2022-02-21 03:35:15,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#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~nondet215#1, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~malloc217#1.base, main_#t~malloc217#1.offset, main_#t~ret218#1.base, main_#t~ret218#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~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;main_~n~0#1 := main_#t~nondet215#1;havoc main_#t~nondet215#1; {28#unseeded} is VALID [2022-02-21 03:35:15,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !(main_~length1~0#1 < 1); {28#unseeded} is VALID [2022-02-21 03:35:15,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#unseeded} assume !(main_~length2~0#1 < 1); {28#unseeded} is VALID [2022-02-21 03:35:15,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#unseeded} assume !(main_~n~0#1 < 1); {28#unseeded} is VALID [2022-02-21 03:35:15,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#unseeded} assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call main_#t~malloc217#1.base, main_#t~malloc217#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc217#1.base, main_#t~malloc217#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset, cstrncat_#t~mem205#1, cstrncat_#t~post210#1, cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset, cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset, cstrncat_#t~mem208#1, cstrncat_#t~short209#1, cstrncat_#t~mem212#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; {28#unseeded} is VALID [2022-02-21 03:35:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:35:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:15,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrncat_~s~0#1.offset|)))} call cstrncat_#t~mem205#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); {116#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrncat_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrncat_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|)))} is VALID [2022-02-21 03:35:15,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrncat_~s~0#1.offset|))) (<= (+ |ULTIMATE.start_cstrncat_~s~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|)))} assume !!(0 != cstrncat_#t~mem205#1);havoc cstrncat_#t~mem205#1;cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post206#1.base, 1 + cstrncat_#t~post206#1.offset;havoc cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset; {96#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_cstrncat_~s~0#1.base|) (* (- 1) |ULTIMATE.start_cstrncat_~s~0#1.offset|)))))} is VALID [2022-02-21 03:35:15,594 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:15,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:15,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:15,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 03:35:15,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,628 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:15,629 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:15,707 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 53 states and 76 transitions. Complement of second has 7 states. [2022-02-21 03:35:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:15,708 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:15,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:15,709 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:35:15,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:15,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:15,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:15,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:15,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:15,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:15,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 76 transitions. [2022-02-21 03:35:15,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:15,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:15,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:15,716 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:15,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:35:15,718 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:35:15,718 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:15,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:15,720 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:15,720 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 76 transitions. cyclomatic complexity: 27 [2022-02-21 03:35:15,721 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:35:15,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:35:15,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 03:35:15,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:35:15,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:15,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:15,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:15,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:35:15,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:35:15,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:35:15,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:35:15,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:35:15,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:35:15,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:15,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:15,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:35:15,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:35:15,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:35:15,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:35:15,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:15,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:15,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:15,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:15,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:15,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:15,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:15,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:15,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:15,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:15,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 03:35:15,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:15,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:35:15,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 03:35:15,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:35:15,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:35:15,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:35:15,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:35:15,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:15,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:15,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:35:15,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:15,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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:15,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:35:15,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:35:15,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:35:15,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:35:15,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:35:15,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:35:15,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 76 transitions. cyclomatic complexity: 27 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:35:15,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,732 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-21 03:35:15,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:35:15,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:15,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:35:15,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:15,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 76 transitions. cyclomatic complexity: 27 [2022-02-21 03:35:15,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:15,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 20 states and 27 transitions. [2022-02-21 03:35:15,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:35:15,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:35:15,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-02-21 03:35:15,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:15,745 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 03:35:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-02-21 03:35:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-21 03:35:15,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:15,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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:15,761 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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:15,762 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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:15,764 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:15,765 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 03:35:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-02-21 03:35:15,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:15,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:15,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 20 states and 27 transitions. [2022-02-21 03:35:15,766 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 20 states and 27 transitions. [2022-02-21 03:35:15,767 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:15,768 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2022-02-21 03:35:15,768 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-02-21 03:35:15,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:15,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:15,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:15,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-02-21 03:35:15,770 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:35:15,770 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:35:15,770 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:15,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-02-21 03:35:15,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:15,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:15,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:15,771 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:15,771 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:15,771 INFO L791 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 194#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~nondet215#1, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~malloc217#1.base, main_#t~malloc217#1.offset, main_#t~ret218#1.base, main_#t~ret218#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~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;main_~n~0#1 := main_#t~nondet215#1;havoc main_#t~nondet215#1; 199#L381 assume !(main_~length1~0#1 < 1); 198#L381-2 assume !(main_~length2~0#1 < 1); 196#L384-1 assume !(main_~n~0#1 < 1); 197#L387-1 assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call main_#t~malloc217#1.base, main_#t~malloc217#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc217#1.base, main_#t~malloc217#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset, cstrncat_#t~mem205#1, cstrncat_#t~post210#1, cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset, cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset, cstrncat_#t~mem208#1, cstrncat_#t~short209#1, cstrncat_#t~mem212#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; 183#L367-3 call cstrncat_#t~mem205#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); 184#L367-1 assume !(0 != cstrncat_#t~mem205#1);havoc cstrncat_#t~mem205#1; 188#L369-4 cstrncat_#t~short209#1 := 0 != cstrncat_~n#1; 189#L369 assume !cstrncat_#t~short209#1; 195#L369-2 assume !!cstrncat_#t~short209#1;havoc cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset;havoc cstrncat_#t~mem208#1;havoc cstrncat_#t~short209#1;cstrncat_#t~post210#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post210#1 - 1;havoc cstrncat_#t~post210#1;cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post211#1.base, 1 + cstrncat_#t~post211#1.offset;havoc cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset; 200#L369-4 cstrncat_#t~short209#1 := 0 != cstrncat_~n#1; 187#L369 [2022-02-21 03:35:15,771 INFO L793 eck$LassoCheckResult]: Loop: 187#L369 assume !cstrncat_#t~short209#1; 190#L369-2 assume !!cstrncat_#t~short209#1;havoc cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset;havoc cstrncat_#t~mem208#1;havoc cstrncat_#t~short209#1;cstrncat_#t~post210#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post210#1 - 1;havoc cstrncat_#t~post210#1;cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post211#1.base, 1 + cstrncat_#t~post211#1.offset;havoc cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset; 186#L369-4 cstrncat_#t~short209#1 := 0 != cstrncat_~n#1; 187#L369 [2022-02-21 03:35:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2022-02-21 03:35:15,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:15,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944543389] [2022-02-21 03:35:15,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:15,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {309#true} is VALID [2022-02-21 03:35:15,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#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~nondet215#1, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~malloc217#1.base, main_#t~malloc217#1.offset, main_#t~ret218#1.base, main_#t~ret218#1.offset, main_~length1~0#1, main_~length2~0#1, main_~n~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;main_~n~0#1 := main_#t~nondet215#1;havoc main_#t~nondet215#1; {309#true} is VALID [2022-02-21 03:35:15,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume !(main_~length1~0#1 < 1); {309#true} is VALID [2022-02-21 03:35:15,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {309#true} assume !(main_~length2~0#1 < 1); {309#true} is VALID [2022-02-21 03:35:15,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {309#true} assume !(main_~n~0#1 < 1); {309#true} is VALID [2022-02-21 03:35:15,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} assume !(main_~length1~0#1 < main_~n~0#1 || main_~length1~0#1 - main_~n~0#1 < main_~length2~0#1);call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc216#1.base, main_#t~malloc216#1.offset;call main_#t~malloc217#1.base, main_#t~malloc217#1.offset := #Ultimate.allocOnStack(main_~length2~0#1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc217#1.base, main_#t~malloc217#1.offset;call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - main_~n~0#1 - 1), 1);call write~int(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, 1);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1);assume { :begin_inline_cstrncat } true;cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset, cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset, cstrncat_#in~n#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset, main_~n~0#1;havoc cstrncat_#res#1.base, cstrncat_#res#1.offset;havoc cstrncat_#t~post206#1.base, cstrncat_#t~post206#1.offset, cstrncat_#t~mem205#1, cstrncat_#t~post210#1, cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset, cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset, cstrncat_#t~mem208#1, cstrncat_#t~short209#1, cstrncat_#t~mem212#1, cstrncat_~s1#1.base, cstrncat_~s1#1.offset, cstrncat_~s2#1.base, cstrncat_~s2#1.offset, cstrncat_~n#1, cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s1#1.base, cstrncat_~s1#1.offset := cstrncat_#in~s1#1.base, cstrncat_#in~s1#1.offset;cstrncat_~s2#1.base, cstrncat_~s2#1.offset := cstrncat_#in~s2#1.base, cstrncat_#in~s2#1.offset;cstrncat_~n#1 := cstrncat_#in~n#1;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_~s1#1.base, cstrncat_~s1#1.offset; {309#true} is VALID [2022-02-21 03:35:15,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#true} call cstrncat_#t~mem205#1 := read~int(cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset, 1); {309#true} is VALID [2022-02-21 03:35:15,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} assume !(0 != cstrncat_#t~mem205#1);havoc cstrncat_#t~mem205#1; {309#true} is VALID [2022-02-21 03:35:15,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} cstrncat_#t~short209#1 := 0 != cstrncat_~n#1; {309#true} is VALID [2022-02-21 03:35:15,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#true} assume !cstrncat_#t~short209#1; {311#(not |ULTIMATE.start_cstrncat_#t~short209#1|)} is VALID [2022-02-21 03:35:15,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {311#(not |ULTIMATE.start_cstrncat_#t~short209#1|)} assume !!cstrncat_#t~short209#1;havoc cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset;havoc cstrncat_#t~mem208#1;havoc cstrncat_#t~short209#1;cstrncat_#t~post210#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post210#1 - 1;havoc cstrncat_#t~post210#1;cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post211#1.base, 1 + cstrncat_#t~post211#1.offset;havoc cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset; {310#false} is VALID [2022-02-21 03:35:15,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {310#false} cstrncat_#t~short209#1 := 0 != cstrncat_~n#1; {310#false} is VALID [2022-02-21 03:35:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:15,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:15,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944543389] [2022-02-21 03:35:15,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944543389] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:15,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:15,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:35:15,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62792362] [2022-02-21 03:35:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:15,829 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:35:15,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:15,829 INFO L85 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2022-02-21 03:35:15,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:15,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955508223] [2022-02-21 03:35:15,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:15,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:15,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume !cstrncat_#t~short209#1; {314#(not |ULTIMATE.start_cstrncat_#t~short209#1|)} is VALID [2022-02-21 03:35:15,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#(not |ULTIMATE.start_cstrncat_#t~short209#1|)} assume !!cstrncat_#t~short209#1;havoc cstrncat_#t~post207#1.base, cstrncat_#t~post207#1.offset;havoc cstrncat_#t~mem208#1;havoc cstrncat_#t~short209#1;cstrncat_#t~post210#1 := cstrncat_~n#1;cstrncat_~n#1 := cstrncat_#t~post210#1 - 1;havoc cstrncat_#t~post210#1;cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset := cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset;cstrncat_~s~0#1.base, cstrncat_~s~0#1.offset := cstrncat_#t~post211#1.base, 1 + cstrncat_#t~post211#1.offset;havoc cstrncat_#t~post211#1.base, cstrncat_#t~post211#1.offset; {313#false} is VALID [2022-02-21 03:35:15,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#false} cstrncat_#t~short209#1 := 0 != cstrncat_~n#1; {313#false} is VALID [2022-02-21 03:35:15,838 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:15,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:15,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955508223] [2022-02-21 03:35:15,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955508223] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:15,838 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:15,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:35:15,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008031284] [2022-02-21 03:35:15,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:15,838 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:15,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:15,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:35:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:35:15,841 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:15,861 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-21 03:35:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:35:15,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:15,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:15,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2022-02-21 03:35:15,866 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:15,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2022-02-21 03:35:15,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:35:15,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:35:15,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:35:15,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:15,867 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:15,867 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:15,867 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:35:15,867 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:15,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:35:15,867 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:35:15,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:35:15,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:35:15 BoogieIcfgContainer [2022-02-21 03:35:15,872 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:35:15,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:35:15,873 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:35:15,873 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:35:15,873 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:12" (3/4) ... [2022-02-21 03:35:15,875 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:35:15,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:35:15,876 INFO L158 Benchmark]: Toolchain (without parser) took 3781.87ms. Allocated memory was 109.1MB in the beginning and 169.9MB in the end (delta: 60.8MB). Free memory was 77.3MB in the beginning and 92.2MB in the end (delta: -14.9MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2022-02-21 03:35:15,876 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory was 67.2MB in the beginning and 67.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:15,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.80ms. Allocated memory was 109.1MB in the beginning and 169.9MB in the end (delta: 60.8MB). Free memory was 77.0MB in the beginning and 133.6MB in the end (delta: -56.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:35:15,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.16ms. Allocated memory is still 169.9MB. Free memory was 133.6MB in the beginning and 131.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:15,877 INFO L158 Benchmark]: Boogie Preprocessor took 30.86ms. Allocated memory is still 169.9MB. Free memory was 131.5MB in the beginning and 129.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:15,877 INFO L158 Benchmark]: RCFGBuilder took 386.73ms. Allocated memory is still 169.9MB. Free memory was 129.4MB in the beginning and 114.5MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:35:15,878 INFO L158 Benchmark]: BuchiAutomizer took 2992.10ms. Allocated memory is still 169.9MB. Free memory was 114.5MB in the beginning and 92.2MB in the end (delta: 22.3MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2022-02-21 03:35:15,878 INFO L158 Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 169.9MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:15,880 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 109.1MB. Free memory was 67.2MB in the beginning and 67.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.80ms. Allocated memory was 109.1MB in the beginning and 169.9MB in the end (delta: 60.8MB). Free memory was 77.0MB in the beginning and 133.6MB in the end (delta: -56.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.16ms. Allocated memory is still 169.9MB. Free memory was 133.6MB in the beginning and 131.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.86ms. Allocated memory is still 169.9MB. Free memory was 131.5MB in the beginning and 129.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 386.73ms. Allocated memory is still 169.9MB. Free memory was 129.4MB in the beginning and 114.5MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 2992.10ms. Allocated memory is still 169.9MB. Free memory was 114.5MB in the beginning and 92.2MB in the end (delta: 22.3MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Witness Printer took 2.35ms. Allocated memory is still 169.9MB. Free memory is still 92.2MB. 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 37 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital205 mio100 ax100 hnf100 lsp97 ukn84 mio100 lsp47 div100 bol100 ite100 ukn100 eq187 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 169ms VariablesStem: 14 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:35:15,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:35:16,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE