./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncpy_reverse_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/cstrncpy_reverse_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 3c4d1f74b81dbb287c4425592070f3cc0de08845db85b6da85a8a6e68f14746e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:19,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:19,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:19,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:19,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:19,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:19,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:19,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:19,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:19,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:19,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:19,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:19,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:19,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:19,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:19,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:19,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:19,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:19,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:19,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:19,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:19,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:19,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:19,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:19,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:19,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:19,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:19,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:19,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:19,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:19,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:19,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:19,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:19,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:19,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:19,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:19,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:19,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:19,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:19,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:19,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:19,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:19,366 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:19,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:19,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:19,367 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:19,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:19,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:19,368 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:19,368 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:19,368 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:19,368 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:19,369 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:19,369 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:19,369 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:19,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:19,370 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:19,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:19,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:19,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:19,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:19,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:19,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:19,371 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:19,371 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:19,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:19,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:19,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:19,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:19,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:19,373 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:19,373 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c4d1f74b81dbb287c4425592070f3cc0de08845db85b6da85a8a6e68f14746e [2022-02-21 03:35:19,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:19,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:19,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:19,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:19,587 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:19,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca.i [2022-02-21 03:35:19,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ae44384/a3fa3d159efa4b4e8f80bafae546a705/FLAG67b4c4a34 [2022-02-21 03:35:20,028 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:20,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca.i [2022-02-21 03:35:20,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ae44384/a3fa3d159efa4b4e8f80bafae546a705/FLAG67b4c4a34 [2022-02-21 03:35:20,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ae44384/a3fa3d159efa4b4e8f80bafae546a705 [2022-02-21 03:35:20,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:20,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:20,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:20,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:20,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:20,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:20" (1/1) ... [2022-02-21 03:35:20,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2313cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20, skipping insertion in model container [2022-02-21 03:35:20,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:20" (1/1) ... [2022-02-21 03:35:20,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:20,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:20,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:20,303 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:20,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:20,390 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:20,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20 WrapperNode [2022-02-21 03:35:20,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:20,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:20,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:20,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:20,398 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:20" (1/1) ... [2022-02-21 03:35:20,415 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:20" (1/1) ... [2022-02-21 03:35:20,438 INFO L137 Inliner]: procedures = 152, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2022-02-21 03:35:20,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:20,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:20,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:20,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:20,445 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:20" (1/1) ... [2022-02-21 03:35:20,446 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:20" (1/1) ... [2022-02-21 03:35:20,456 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:20" (1/1) ... [2022-02-21 03:35:20,457 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:20" (1/1) ... [2022-02-21 03:35:20,462 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:20" (1/1) ... [2022-02-21 03:35:20,464 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:20" (1/1) ... [2022-02-21 03:35:20,465 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:20" (1/1) ... [2022-02-21 03:35:20,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:20,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:20,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:20,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:20,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20" (1/1) ... [2022-02-21 03:35:20,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:20,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:20,533 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:20,551 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:20,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:20,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:20,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:35:20,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:20,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:20,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:20,619 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:20,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:20,809 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:20,814 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:20,814 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:35:20,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:20 BoogieIcfgContainer [2022-02-21 03:35:20,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:20,816 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:20,816 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:20,818 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:20,819 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:20,819 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:20" (1/3) ... [2022-02-21 03:35:20,820 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a4969bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:20, skipping insertion in model container [2022-02-21 03:35:20,820 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:20,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:20" (2/3) ... [2022-02-21 03:35:20,820 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a4969bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:20, skipping insertion in model container [2022-02-21 03:35:20,820 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:20,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:20" (3/3) ... [2022-02-21 03:35:20,821 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrncpy_reverse_alloca.i [2022-02-21 03:35:20,863 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:20,863 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:20,863 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:20,863 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:20,864 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:20,864 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:20,864 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:20,864 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:20,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:20,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:20,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:20,912 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:20,913 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:20,913 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:20,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:20,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:20,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:20,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:20,917 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:35:20,917 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:20,922 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet211#1, main_#t~nondet212#1, main_#t~malloc213#1.base, main_#t~malloc213#1.offset, main_#t~malloc214#1.base, main_#t~malloc214#1.offset, main_#t~ret215#1.base, main_#t~ret215#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet211#1;havoc main_#t~nondet211#1;main_~n~0#1 := main_#t~nondet212#1;havoc main_#t~nondet212#1; 12#L385true assume !(main_~length~0#1 < 1); 7#L385-2true assume !(main_~n~0#1 < 1); 6#L388-1true call main_#t~malloc213#1.base, main_#t~malloc213#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, 1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + (main_~n~0#1 - 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post205#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, cstrncpy_#t~mem208#1, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, cstrncpy_#t~post209#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; 15#L370-2true [2022-02-21 03:35:20,922 INFO L793 eck$LassoCheckResult]: Loop: 15#L370-2true assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post205#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post205#1 - 1;havoc cstrncpy_#t~post205#1;cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset - 1;cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset - 1;call cstrncpy_#t~mem208#1 := read~int(cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, 1);call write~int(cstrncpy_#t~mem208#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, 1); 14#L372true assume !(0 == cstrncpy_#t~mem208#1);havoc cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset;havoc cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset;havoc cstrncpy_#t~mem208#1; 15#L370-2true [2022-02-21 03:35:20,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 03:35:20,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:20,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119094203] [2022-02-21 03:35:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,103 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,154 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2022-02-21 03:35:21,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676072836] [2022-02-21 03:35:21,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,184 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,198 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:21,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2022-02-21 03:35:21,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:21,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421431439] [2022-02-21 03:35:21,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:21,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,266 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:21,320 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:21,998 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:21,998 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:21,998 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:21,998 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:21,999 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:21,999 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:21,999 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:21,999 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:21,999 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy_reverse_alloca.i_Iteration1_Lasso [2022-02-21 03:35:21,999 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:22,000 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:22,016 INFO L141 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:22,021 INFO L141 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:22,023 INFO L141 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:22,025 INFO L141 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:22,027 INFO L141 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:22,029 INFO L141 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:22,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:22,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:22,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:22,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:22,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:22,044 INFO L141 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:22,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:22,570 INFO L141 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:22,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:22,574 INFO L141 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:22,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:22,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:22,579 INFO L141 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:22,580 INFO L141 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:22,582 INFO L141 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:22,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:23,090 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:23,093 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:23,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,108 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:23,109 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:23,113 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:23,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,144 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:23,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,145 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:23,146 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:23,147 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:23,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,186 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:23,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,188 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:23,190 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:23,190 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:23,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,226 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:23,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,228 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:23,229 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:23,230 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:23,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,289 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:23,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,298 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:23,303 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:23,304 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:23,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:35:23,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,336 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:23,337 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:23,338 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:23,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,417 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:23,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:35:23,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,459 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:35:23,462 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:23,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,503 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:35:23,505 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:23,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,566 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:35:23,568 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:23,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:35:23,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,593 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:35:23,595 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:23,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:23,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:23,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:23,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,634 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:35:23,635 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:23,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,675 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:35:23,677 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:23,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,725 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:35:23,753 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:23,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,785 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:35:23,787 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:23,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,828 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:35:23,832 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:23,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:23,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:23,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,877 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:35:23,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:23,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:23,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:23,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:23,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:23,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:23,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:23,915 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:23,940 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:35:23,940 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-02-21 03:35:23,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:23,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:23,943 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:23,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:35:23,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:23,966 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:23,967 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:23,967 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~src~0#1.offset) = 2*ULTIMATE.start_cstrncpy_~src~0#1.offset + 1 Supporting invariants [] [2022-02-21 03:35:23,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:35:24,055 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2022-02-21 03:35:24,060 INFO L390 LassoCheck]: Loop: "assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post205#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post205#1 - 1;havoc cstrncpy_#t~post205#1;cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset - 1;cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset - 1;call cstrncpy_#t~mem208#1 := read~int(cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, 1);call write~int(cstrncpy_#t~mem208#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, 1);" "assume !(0 == cstrncpy_#t~mem208#1);havoc cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset;havoc cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset;havoc cstrncpy_#t~mem208#1;" [2022-02-21 03:35:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:24,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:24,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:24,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:24,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {24#unseeded} is VALID [2022-02-21 03:35:24,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet211#1, main_#t~nondet212#1, main_#t~malloc213#1.base, main_#t~malloc213#1.offset, main_#t~malloc214#1.base, main_#t~malloc214#1.offset, main_#t~ret215#1.base, main_#t~ret215#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet211#1;havoc main_#t~nondet211#1;main_~n~0#1 := main_#t~nondet212#1;havoc main_#t~nondet212#1; {24#unseeded} is VALID [2022-02-21 03:35:24,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#unseeded} assume !(main_~length~0#1 < 1); {24#unseeded} is VALID [2022-02-21 03:35:24,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#unseeded} assume !(main_~n~0#1 < 1); {24#unseeded} is VALID [2022-02-21 03:35:24,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#unseeded} call main_#t~malloc213#1.base, main_#t~malloc213#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, 1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + (main_~n~0#1 - 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post205#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, cstrncpy_#t~mem208#1, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, cstrncpy_#t~post209#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; {24#unseeded} is VALID [2022-02-21 03:35:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:24,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:35:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:24,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:24,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(>= oldRank0 (+ (* 2 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) 1))} assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post205#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post205#1 - 1;havoc cstrncpy_#t~post205#1;cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset - 1;cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset - 1;call cstrncpy_#t~mem208#1 := read~int(cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, 1);call write~int(cstrncpy_#t~mem208#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, 1); {114#(and (<= 0 (div (+ (- 1) oldRank0) 2)) (<= (+ |ULTIMATE.start_cstrncpy_~src~0#1.offset| 1) (div (+ (- 1) oldRank0) 2)))} is VALID [2022-02-21 03:35:24,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#(and (<= 0 (div (+ (- 1) oldRank0) 2)) (<= (+ |ULTIMATE.start_cstrncpy_~src~0#1.offset| 1) (div (+ (- 1) oldRank0) 2)))} assume !(0 == cstrncpy_#t~mem208#1);havoc cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset;havoc cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset;havoc cstrncpy_#t~mem208#1; {97#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_cstrncpy_~src~0#1.offset|) 1))))} is VALID [2022-02-21 03:35:24,181 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:24,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:24,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:24,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:24,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,211 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:24,212 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:24,269 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 30 states and 40 transitions. Complement of second has 5 states. [2022-02-21 03:35:24,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:24,269 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:24,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:24,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:24,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:24,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:24,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:24,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:35:24,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:24,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:24,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 40 transitions. [2022-02-21 03:35:24,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:24,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:24,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:24,277 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:24,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:24,279 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:35:24,279 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:24,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:35:24,280 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:24,281 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 40 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:24,281 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:24,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:24,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:24,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:24,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:35:24,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 1 letters. [2022-02-21 03:35:24,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:35:24,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:24,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 03:35:24,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:24,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:35:24,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:35:24,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:35:24,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:35:24,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:35:24,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:35:24,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:24,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:24,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:35:24,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:24,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:24,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:24,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:24,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 03:35:24,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:24,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:24,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:24,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:24,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:35:24,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:24,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:35:24,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:35:24,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:24,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:35:24,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:35:24,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 1 letters. [2022-02-21 03:35:24,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:35:24,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:24,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 03:35:24,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:35:24,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:35:24,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 2 letters. [2022-02-21 03:35:24,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:35:24,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,294 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-02-21 03:35:24,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:35:24,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:35:24,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:35:24,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:24,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:24,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:24,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2022-02-21 03:35:24,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:35:24,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:35:24,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-02-21 03:35:24,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:24,306 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:35:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-02-21 03:35:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-02-21 03:35:24,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:24,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:24,322 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:24,323 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:24,325 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 03:35:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:35:24,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:24,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:24,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 14 transitions. [2022-02-21 03:35:24,327 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 14 transitions. [2022-02-21 03:35:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:24,327 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 03:35:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:35:24,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:24,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:24,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:24,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:35:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-02-21 03:35:24,329 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:35:24,329 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:35:24,330 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:24,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:35:24,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:35:24,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:24,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:24,330 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:24,331 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:35:24,331 INFO L791 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet211#1, main_#t~nondet212#1, main_#t~malloc213#1.base, main_#t~malloc213#1.offset, main_#t~malloc214#1.base, main_#t~malloc214#1.offset, main_#t~ret215#1.base, main_#t~ret215#1.offset, main_~length~0#1, main_~n~0#1, main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset;main_~length~0#1 := main_#t~nondet211#1;havoc main_#t~nondet211#1;main_~n~0#1 := main_#t~nondet212#1;havoc main_#t~nondet212#1; 162#L385 assume !(main_~length~0#1 < 1); 161#L385-2 assume !(main_~n~0#1 < 1); 159#L388-1 call main_#t~malloc213#1.base, main_#t~malloc213#1.offset := #Ultimate.allocOnStack(main_~n~0#1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_#t~malloc213#1.base, main_#t~malloc213#1.offset;call main_#t~malloc214#1.base, main_#t~malloc214#1.offset := #Ultimate.allocOnStack(main_~length~0#1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_#t~malloc214#1.base, main_#t~malloc214#1.offset;call write~int(0, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, 1);main_~nondetString~0#1.base, main_~nondetString~0#1.offset := main_~nondetString~0#1.base, main_~nondetString~0#1.offset + (main_~length~0#1 - 1);main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset + (main_~n~0#1 - 1);assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset, cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset, cstrncpy_#in~n#1 := main_~nondetArea~0#1.base, main_~nondetArea~0#1.offset, main_~nondetString~0#1.base, main_~nondetString~0#1.offset, main_~n~0#1;havoc cstrncpy_#res#1.base, cstrncpy_#res#1.offset;havoc cstrncpy_#t~post205#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, cstrncpy_#t~mem208#1, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, cstrncpy_#t~post209#1, cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset, cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset, cstrncpy_~n#1, cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset, cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset, cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset, cstrncpy_~n2~0#1;cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset := cstrncpy_#in~s1#1.base, cstrncpy_#in~s1#1.offset;cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset := cstrncpy_#in~s2#1.base, cstrncpy_#in~s2#1.offset;cstrncpy_~n#1 := cstrncpy_#in~n#1;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_~s1#1.base, cstrncpy_~s1#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_~s2#1.base, cstrncpy_~s2#1.offset;havoc cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;havoc cstrncpy_~n2~0#1; 160#L370-2 assume !!(cstrncpy_~n#1 > 0);cstrncpy_#t~post205#1 := cstrncpy_~n#1;cstrncpy_~n#1 := cstrncpy_#t~post205#1 - 1;havoc cstrncpy_#t~post205#1;cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset := cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset - 1;cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset := cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset;cstrncpy_~src~0#1.base, cstrncpy_~src~0#1.offset := cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset - 1;call cstrncpy_#t~mem208#1 := read~int(cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset, 1);call write~int(cstrncpy_#t~mem208#1, cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset, 1); 163#L372 assume 0 == cstrncpy_#t~mem208#1;havoc cstrncpy_#t~post206#1.base, cstrncpy_#t~post206#1.offset;havoc cstrncpy_#t~post207#1.base, cstrncpy_#t~post207#1.offset;havoc cstrncpy_#t~mem208#1;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_~dst~0#1.base, cstrncpy_~dst~0#1.offset;cstrncpy_~n2~0#1 := cstrncpy_~n#1; 157#L375-3 [2022-02-21 03:35:24,331 INFO L793 eck$LassoCheckResult]: Loop: 157#L375-3 cstrncpy_#t~post209#1 := cstrncpy_~n2~0#1;cstrncpy_~n2~0#1 := cstrncpy_#t~post209#1 - 1; 158#L375-1 assume !!(0 != cstrncpy_#t~post209#1);havoc cstrncpy_#t~post209#1;cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset := cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset;cstrncpy_~us~0#1.base, cstrncpy_~us~0#1.offset := cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset - 1;call write~int(0, cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset, 1);havoc cstrncpy_#t~post210#1.base, cstrncpy_#t~post210#1.offset; 157#L375-3 [2022-02-21 03:35:24,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:24,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2022-02-21 03:35:24,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:24,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51294604] [2022-02-21 03:35:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:24,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,354 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,371 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2022-02-21 03:35:24,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:24,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837397275] [2022-02-21 03:35:24,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:24,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,381 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:24,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2022-02-21 03:35:24,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:24,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72379563] [2022-02-21 03:35:24,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:24,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:24,421 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:24,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:25,421 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:25,421 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:25,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:25,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:25,421 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:25,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:25,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:25,421 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:25,421 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy_reverse_alloca.i_Iteration2_Lasso [2022-02-21 03:35:25,421 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:25,421 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:25,424 INFO L141 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:25,426 INFO L141 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:25,428 INFO L141 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:25,430 INFO L141 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:25,431 INFO L141 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:25,433 INFO L141 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:25,435 INFO L141 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:25,438 INFO L141 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:25,440 INFO L141 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:25,442 INFO L141 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:25,444 INFO L141 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:25,446 INFO L141 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:25,448 INFO L141 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:25,450 INFO L141 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:25,451 INFO L141 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:25,454 INFO L141 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:25,904 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString~0#1.base) (+ (* (- 1) ULTIMATE.start_main_~length~0#1) ULTIMATE.start_main_~nondetString~0#1.offset 1))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:35:25,910 INFO L158 Benchmark]: Toolchain (without parser) took 5846.30ms. Allocated memory was 98.6MB in the beginning and 186.6MB in the end (delta: 88.1MB). Free memory was 77.6MB in the beginning and 135.4MB in the end (delta: -57.9MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. [2022-02-21 03:35:25,911 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:35:25,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.24ms. Allocated memory is still 98.6MB. Free memory was 77.3MB in the beginning and 64.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:35:25,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.35ms. Allocated memory is still 98.6MB. Free memory was 64.0MB in the beginning and 62.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:25,913 INFO L158 Benchmark]: Boogie Preprocessor took 27.49ms. Allocated memory is still 98.6MB. Free memory was 62.0MB in the beginning and 60.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:35:25,913 INFO L158 Benchmark]: RCFGBuilder took 347.71ms. Allocated memory is still 98.6MB. Free memory was 60.3MB in the beginning and 46.1MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:35:25,914 INFO L158 Benchmark]: BuchiAutomizer took 5093.33ms. Allocated memory was 98.6MB in the beginning and 186.6MB in the end (delta: 88.1MB). Free memory was 46.1MB in the beginning and 135.4MB in the end (delta: -89.4MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2022-02-21 03:35:25,916 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.16ms. Allocated memory is still 98.6MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.24ms. Allocated memory is still 98.6MB. Free memory was 77.3MB in the beginning and 64.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.35ms. Allocated memory is still 98.6MB. Free memory was 64.0MB in the beginning and 62.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.49ms. Allocated memory is still 98.6MB. Free memory was 62.0MB in the beginning and 60.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 347.71ms. Allocated memory is still 98.6MB. Free memory was 60.3MB in the beginning and 46.1MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 5093.33ms. Allocated memory was 98.6MB in the beginning and 186.6MB in the end (delta: 88.1MB). Free memory was 46.1MB in the beginning and 135.4MB in the end (delta: -89.4MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString~0#1.base) (+ (* (- 1) ULTIMATE.start_main_~length~0#1) ULTIMATE.start_main_~nondetString~0#1.offset 1))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString~0#1.base) (+ (* (- 1) ULTIMATE.start_main_~length~0#1) ULTIMATE.start_main_~nondetString~0#1.offset 1))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:35:25,961 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~nondetString~0#1.base) (+ (* (- 1) ULTIMATE.start_main_~length~0#1) ULTIMATE.start_main_~nondetString~0#1.offset 1))_1 was not added to the transformula!