./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 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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 cd1d6be80620224d07434e02e12c771f8c62f3e2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:39:46,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:39:46,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:39:46,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:39:46,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:39:46,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:39:46,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:39:46,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:39:46,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:39:46,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:39:46,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:39:46,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:39:46,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:39:46,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:39:46,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:39:46,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:39:46,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:39:46,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:39:46,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:39:46,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:39:46,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:39:46,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:39:46,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:39:46,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:39:46,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:39:46,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:39:46,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:39:46,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:39:46,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:39:46,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:39:46,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:39:46,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:39:46,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:39:46,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:39:46,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:39:46,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:39:46,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:39:46,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:39:46,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:39:46,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:39:46,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:39:46,877 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:39:46,904 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:39:46,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:39:46,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:39:46,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:39:46,908 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:39:46,908 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:39:46,908 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:39:46,908 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:39:46,909 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:39:46,909 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:39:46,910 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:39:46,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:39:46,911 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:39:46,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:39:46,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:39:46,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:39:46,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:39:46,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:39:46,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:39:46,913 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:39:46,914 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:39:46,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:39:46,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:39:46,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:39:46,915 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:39:46,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:39:46,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:39:46,916 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:39:46,916 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:39:46,918 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:39:46,918 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> cd1d6be80620224d07434e02e12c771f8c62f3e2 [2020-07-29 01:39:47,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:39:47,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:39:47,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:39:47,246 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:39:47,246 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:39:47,250 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca.i [2020-07-29 01:39:47,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bbe1592c/e80c3d62bac24f41a318a3f43f291282/FLAG7b080ab73 [2020-07-29 01:39:47,876 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:39:47,877 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca.i [2020-07-29 01:39:47,888 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bbe1592c/e80c3d62bac24f41a318a3f43f291282/FLAG7b080ab73 [2020-07-29 01:39:48,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bbe1592c/e80c3d62bac24f41a318a3f43f291282 [2020-07-29 01:39:48,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:39:48,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:39:48,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:48,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:39:48,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:39:48,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:48" (1/1) ... [2020-07-29 01:39:48,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8f0e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48, skipping insertion in model container [2020-07-29 01:39:48,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:48" (1/1) ... [2020-07-29 01:39:48,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:39:48,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:39:48,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:48,637 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:39:48,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:48,762 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:39:48,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48 WrapperNode [2020-07-29 01:39:48,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:48,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:48,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:39:48,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:39:48,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48" (1/1) ... [2020-07-29 01:39:48,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48" (1/1) ... [2020-07-29 01:39:48,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:48,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:39:48,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:39:48,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:39:48,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48" (1/1) ... [2020-07-29 01:39:48,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48" (1/1) ... [2020-07-29 01:39:48,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48" (1/1) ... [2020-07-29 01:39:48,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48" (1/1) ... [2020-07-29 01:39:48,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48" (1/1) ... [2020-07-29 01:39:48,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48" (1/1) ... [2020-07-29 01:39:48,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48" (1/1) ... [2020-07-29 01:39:48,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:39:48,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:39:48,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:39:48,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:39:48,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:48,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:39:48,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:39:48,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:39:48,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:39:48,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:39:48,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:39:49,409 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:39:49,409 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:39:49,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:49 BoogieIcfgContainer [2020-07-29 01:39:49,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:39:49,414 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:39:49,414 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:39:49,418 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:39:49,419 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:49,420 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:39:48" (1/3) ... [2020-07-29 01:39:49,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1caaa368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:49, skipping insertion in model container [2020-07-29 01:39:49,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:49,424 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:48" (2/3) ... [2020-07-29 01:39:49,425 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1caaa368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:49, skipping insertion in model container [2020-07-29 01:39:49,425 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:49,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:49" (3/3) ... [2020-07-29 01:39:49,427 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncpy_reverse_alloca.i [2020-07-29 01:39:49,475 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:39:49,475 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:39:49,475 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:39:49,476 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:39:49,477 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:39:49,477 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:39:49,477 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:39:49,477 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:39:49,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:39:49,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:39:49,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:49,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:49,524 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:49,524 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:49,524 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:39:49,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:39:49,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:39:49,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:49,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:49,529 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:49,529 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:49,538 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 5#L385true assume !(main_~length~0 < 1); 7#L385-2true assume !(main_~n~0 < 1); 3#L388-1true call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset, 1);main_~nondetString~0.base, main_~nondetString~0.offset := main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 14#L370-2true [2020-07-29 01:39:49,539 INFO L796 eck$LassoCheckResult]: Loop: 14#L370-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset - 1;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 9#L372true assume !(0 == cstrncpy_#t~mem208);havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset; 14#L370-2true [2020-07-29 01:39:49,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:49,546 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 01:39:49,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:49,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968608543] [2020-07-29 01:39:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:49,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:49,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:49,721 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:49,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2020-07-29 01:39:49,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:49,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889284129] [2020-07-29 01:39:49,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:49,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:49,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:49,753 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:49,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:49,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2020-07-29 01:39:49,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:49,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106629868] [2020-07-29 01:39:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:49,797 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:49,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:49,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:49,961 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-29 01:39:50,645 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2020-07-29 01:39:50,840 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-07-29 01:39:50,856 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:50,857 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:50,857 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:50,857 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:50,857 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:50,858 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:50,858 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:50,858 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:50,858 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy_reverse_alloca.i_Iteration1_Lasso [2020-07-29 01:39:50,858 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:50,859 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:50,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:50,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:50,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:50,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:50,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,400 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-07-29 01:39:51,595 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-07-29 01:39:51,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:51,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:52,778 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:52,785 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:52,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:52,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:52,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:52,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:52,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:52,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:52,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:52,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:52,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:52,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:52,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:52,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:52,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:52,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:52,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:52,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:52,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:52,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:52,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:52,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:52,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:52,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:52,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:52,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:52,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:52,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:52,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:52,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:52,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:52,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:52,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:52,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:52,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:52,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:52,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:52,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:52,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:52,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:52,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:52,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:52,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:52,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:52,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:52,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:53,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:53,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:53,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:53,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:53,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:53,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:53,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:53,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:53,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:53,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:53,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:53,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:53,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:53,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:53,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:53,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:53,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:53,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:53,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:53,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:53,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:53,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:53,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:53,138 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:53,307 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:39:53,307 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:53,321 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:39:53,327 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:53,327 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:53,328 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2020-07-29 01:39:53,406 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2020-07-29 01:39:53,415 INFO L393 LassoCheck]: Loop: "assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset - 1;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1);" "assume !(0 == cstrncpy_#t~mem208);havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;" [2020-07-29 01:39:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:53,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:53,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:53,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:53,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {24#unseeded} is VALID [2020-07-29 01:39:53,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#unseeded} havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; {24#unseeded} is VALID [2020-07-29 01:39:53,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#unseeded} assume !(main_~length~0 < 1); {24#unseeded} is VALID [2020-07-29 01:39:53,516 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#unseeded} assume !(main_~n~0 < 1); {24#unseeded} is VALID [2020-07-29 01:39:53,517 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#unseeded} call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset, 1);main_~nondetString~0.base, main_~nondetString~0.offset := main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; {24#unseeded} is VALID [2020-07-29 01:39:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:53,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:53,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:53,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#(>= oldRank0 ULTIMATE.start_cstrncpy_~n)} assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset - 1;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); {104#(and (<= (+ ULTIMATE.start_cstrncpy_~n 1) oldRank0) (<= 1 oldRank0))} is VALID [2020-07-29 01:39:53,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {104#(and (<= (+ ULTIMATE.start_cstrncpy_~n 1) oldRank0) (<= 1 oldRank0))} assume !(0 == cstrncpy_#t~mem208);havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset; {87#(or (and (> oldRank0 ULTIMATE.start_cstrncpy_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:39:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:53,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:53,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:53,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:53,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,654 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 [2020-07-29 01:39:53,656 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2020-07-29 01:39:53,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2020-07-29 01:39:53,750 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 [2020-07-29 01:39:53,750 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:53,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:39:53,753 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:39:53,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:53,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:53,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:53,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:39:53,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:53,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:53,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:39:53,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:53,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:53,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:53,764 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states. [2020-07-29 01:39:53,767 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:39:53,768 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:39:53,769 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:53,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:39:53,772 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:53,773 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 40 transitions. cyclomatic complexity: 13 [2020-07-29 01:39:53,773 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:53,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:53,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:53,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:53,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:39:53,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:39:53,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:39:53,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:53,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:53,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:53,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:39:53,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:39:53,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:39:53,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:39:53,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:39:53,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:39:53,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:53,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:53,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:53,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:53,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:53,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:53,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:53,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:53,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:53,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:53,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:53,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:53,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:53,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:53,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:53,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:39:53,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:39:53,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:39:53,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:39:53,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:39:53,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:39:53,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:53,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:53,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:53,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:53,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:53,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 40 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:53,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,796 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 01:39:53,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:53,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:53,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:39:53,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:53,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. cyclomatic complexity: 13 [2020-07-29 01:39:53,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:53,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2020-07-29 01:39:53,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:39:53,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:39:53,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-07-29 01:39:53,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:53,816 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:39:53,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-07-29 01:39:53,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-29 01:39:53,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:53,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand 10 states. [2020-07-29 01:39:53,853 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand 10 states. [2020-07-29 01:39:53,856 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 10 states. [2020-07-29 01:39:53,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:53,862 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:39:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:39:53,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:53,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:53,865 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states and 14 transitions. [2020-07-29 01:39:53,865 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states and 14 transitions. [2020-07-29 01:39:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:53,866 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:39:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:39:53,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:53,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:53,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:53,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:39:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-29 01:39:53,871 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:39:53,871 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:39:53,871 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:39:53,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:39:53,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:53,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:53,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:53,873 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:53,873 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:53,874 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 149#L-1 havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 150#L385 assume !(main_~length~0 < 1); 154#L385-2 assume !(main_~n~0 < 1); 152#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset, 1);main_~nondetString~0.base, main_~nondetString~0.offset := main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 153#L370-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset - 1;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 147#L372 assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 145#L375-3 [2020-07-29 01:39:53,874 INFO L796 eck$LassoCheckResult]: Loop: 145#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 146#L375-1 assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset - 1;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 145#L375-3 [2020-07-29 01:39:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:53,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2020-07-29 01:39:53,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:53,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489687038] [2020-07-29 01:39:53,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:53,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:53,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:53,943 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:53,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:53,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2020-07-29 01:39:53,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:53,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207169727] [2020-07-29 01:39:53,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:53,951 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:53,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:53,964 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:53,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2020-07-29 01:39:53,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:53,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115980150] [2020-07-29 01:39:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:54,002 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:54,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:54,065 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:54,967 WARN L193 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 128 [2020-07-29 01:39:55,252 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-07-29 01:39:55,256 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:55,256 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:55,257 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:55,257 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:55,257 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:55,257 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:55,257 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:55,257 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:55,258 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncpy_reverse_alloca.i_Iteration2_Lasso [2020-07-29 01:39:55,258 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:55,258 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:55,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,831 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2020-07-29 01:39:55,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:56,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:56,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:56,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:56,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:57,311 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:57,311 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:57,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:57,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:57,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:57,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:57,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:57,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:57,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:57,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:57,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:57,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:57,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:57,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:57,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:57,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:57,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:57,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:57,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:57,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:57,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:57,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:57,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:57,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:57,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:57,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:57,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:57,729 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:39:57,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,756 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 01:39:57,756 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 01:39:57,839 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:57,945 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 01:39:57,945 INFO L444 ModelExtractionUtils]: 46 out of 66 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:57,962 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:57,968 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2020-07-29 01:39:57,968 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:57,968 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset) = 2*ULTIMATE.start_cstrncpy_~us~0.offset + 1 Supporting invariants [] [2020-07-29 01:39:58,049 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-07-29 01:39:58,056 INFO L393 LassoCheck]: Loop: "cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1;" "assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset - 1;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset;" [2020-07-29 01:39:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:58,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:58,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:58,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {186#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {186#unseeded} is VALID [2020-07-29 01:39:58,193 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#unseeded} havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; {186#unseeded} is VALID [2020-07-29 01:39:58,194 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#unseeded} assume !(main_~length~0 < 1); {186#unseeded} is VALID [2020-07-29 01:39:58,195 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#unseeded} assume !(main_~n~0 < 1); {186#unseeded} is VALID [2020-07-29 01:39:58,196 INFO L280 TraceCheckUtils]: 4: Hoare triple {186#unseeded} call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset, 1);main_~nondetString~0.base, main_~nondetString~0.offset := main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; {186#unseeded} is VALID [2020-07-29 01:39:58,197 INFO L280 TraceCheckUtils]: 5: Hoare triple {186#unseeded} assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset - 1;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); {186#unseeded} is VALID [2020-07-29 01:39:58,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {186#unseeded} assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; {186#unseeded} is VALID [2020-07-29 01:39:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:58,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:58,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:58,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {189#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrncpy_~us~0.offset) 1))} cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; {189#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrncpy_~us~0.offset) 1))} is VALID [2020-07-29 01:39:58,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#(>= oldRank0 (+ (* 2 ULTIMATE.start_cstrncpy_~us~0.offset) 1))} assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset - 1;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; {254#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_cstrncpy_~us~0.offset) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:39:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:58,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:58,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:58,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:58,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,233 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:39:58,233 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:39:58,260 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 12 states and 16 transitions. Complement of second has 4 states. [2020-07-29 01:39:58,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:58,260 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:58,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:58,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:58,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:58,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:58,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:58,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:58,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:58,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:39:58,264 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:58,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:58,264 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:58,265 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:58,265 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:58,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:58,266 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:58,267 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:58,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:58,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:58,267 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:39:58,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:58,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:58,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:58,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:58,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:58,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:58,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:39:58,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:39:58,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:39:58,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:39:58,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:39:58,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:39:58,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:58,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:58,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:58,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:58,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:58,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:58,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:58,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:58,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:58,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:58,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:58,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:58,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,274 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-07-29 01:39:58,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:58,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:58,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:58,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:58,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:58,278 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:58,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2020-07-29 01:39:58,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:39:58,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:39:58,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:39:58,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:58,279 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:58,279 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:58,279 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:58,279 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:39:58,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:39:58,279 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:58,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:58,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:39:58 BoogieIcfgContainer [2020-07-29 01:39:58,286 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:39:58,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:39:58,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:39:58,286 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:39:58,287 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:49" (3/4) ... [2020-07-29 01:39:58,290 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:39:58,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:39:58,293 INFO L168 Benchmark]: Toolchain (without parser) took 10175.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.2 MB). Free memory was 956.2 MB in the beginning and 1.3 GB in the end (delta: -339.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:58,293 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:58,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:58,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:58,296 INFO L168 Benchmark]: Boogie Preprocessor took 33.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:58,296 INFO L168 Benchmark]: RCFGBuilder took 553.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:58,297 INFO L168 Benchmark]: BuchiAutomizer took 8871.98 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -216.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:58,298 INFO L168 Benchmark]: Witness Printer took 4.39 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:58,302 INFO L336 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.47 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 643.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 553.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8871.98 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -216.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.39 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function 2 * us + 1 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 8.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 29 SDslu, 9 SDs, 0 SdLazy, 6 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital232 mio100 ax100 hnf99 lsp97 ukn84 mio100 lsp36 div100 bol100 ite100 ukn100 eq198 hnf89 smp100 dnf115 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 254ms VariablesStem: 12 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...