./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer --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 493d4075183da22c41b393b09f987b5f1b55266e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:41,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:41,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:41,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:41,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:41,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:41,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:41,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:41,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:41,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:41,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:41,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:41,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:41,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:41,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:41,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:41,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:41,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:41,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:41,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:41,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:41,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:41,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:41,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:41,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:41,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:41,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:41,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:41,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:41,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:41,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:41,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:41,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:41,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:41,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:41,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:41,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:41,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:41,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:41,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:41,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:42,000 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:59:42,016 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:42,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:42,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:42,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:42,018 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:42,018 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:42,018 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:42,019 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:42,019 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:42,019 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:42,020 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:42,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:42,020 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:42,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:42,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:42,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:42,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:42,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:42,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:42,021 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:42,022 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:42,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:42,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:42,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:42,023 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:42,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:42,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:42,024 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:42,025 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:42,025 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer 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 -> 493d4075183da22c41b393b09f987b5f1b55266e [2019-10-22 08:59:42,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:42,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:42,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:42,070 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:42,070 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:42,071 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i [2019-10-22 08:59:42,116 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer/data/c8b56110a/2957db4df306461fb1048c444ca4ea34/FLAG0e9737feb [2019-10-22 08:59:42,571 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:42,572 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca.i [2019-10-22 08:59:42,579 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer/data/c8b56110a/2957db4df306461fb1048c444ca4ea34/FLAG0e9737feb [2019-10-22 08:59:42,922 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer/data/c8b56110a/2957db4df306461fb1048c444ca4ea34 [2019-10-22 08:59:42,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:42,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:42,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:42,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:42,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:42,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616594e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42, skipping insertion in model container [2019-10-22 08:59:42,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,941 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:42,970 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:43,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:43,340 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:43,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:43,423 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:43,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43 WrapperNode [2019-10-22 08:59:43,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:43,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:43,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:43,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:43,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:43,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:43,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:43,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:43,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:43,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:43,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:43,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:43,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bbb52120-ce3e-40d2-80ba-f70c6b692fea/bin/uautomizer/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 [2019-10-22 08:59:43,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:43,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:43,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:43,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:43,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:43,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:43,841 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:43,842 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:59:43,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:43 BoogieIcfgContainer [2019-10-22 08:59:43,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:43,843 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:43,844 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:43,846 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:43,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:43,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:42" (1/3) ... [2019-10-22 08:59:43,848 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15329e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:43, skipping insertion in model container [2019-10-22 08:59:43,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:43,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (2/3) ... [2019-10-22 08:59:43,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15329e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:43, skipping insertion in model container [2019-10-22 08:59:43,849 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:43,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:43" (3/3) ... [2019-10-22 08:59:43,850 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncpy_mixed_alloca.i [2019-10-22 08:59:43,907 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:43,908 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:43,908 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:43,908 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:43,908 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:43,908 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:43,908 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:43,908 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:43,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:59:43,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:59:43,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:43,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:43,950 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:43,950 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:43,950 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:43,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 08:59:43,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:59:43,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:43,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:43,952 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:43,952 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:43,961 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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 + (main_~length~0 - 1), 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 [2019-10-22 08:59:43,961 INFO L793 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, 1 + cstrncpy_#t~post207.offset;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~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208; 14#L370-2true [2019-10-22 08:59:43,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:59:43,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356713027] [2019-10-22 08:59:43,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,134 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:44,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-10-22 08:59:44,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317989675] [2019-10-22 08:59:44,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,156 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:44,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-10-22 08:59:44,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675497081] [2019-10-22 08:59:44,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,218 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:44,329 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-10-22 08:59:44,793 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-10-22 08:59:44,900 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-10-22 08:59:44,910 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:44,911 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:44,911 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:44,911 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:44,912 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:44,912 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:44,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:44,912 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:44,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_mixed_alloca.i_Iteration1_Lasso [2019-10-22 08:59:44,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:44,913 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:44,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,296 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-10-22 08:59:45,461 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-22 08:59:45,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,282 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:59:46,373 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:46,381 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:46,384 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 [2019-10-22 08:59:46,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:46,386 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:46,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:46,387 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:46,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:46,390 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:46,390 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:46,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:46,394 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 [2019-10-22 08:59:46,395 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:46,395 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:46,395 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:46,395 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:46,396 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:46,396 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:46,396 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:46,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:46,397 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 [2019-10-22 08:59:46,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:46,398 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:46,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:46,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:46,399 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:46,401 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:46,401 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:46,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:46,403 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 [2019-10-22 08:59:46,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:46,404 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:46,404 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:46,404 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:46,404 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:46,405 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:46,405 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:46,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:46,406 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 [2019-10-22 08:59:46,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:46,419 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:46,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:46,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:46,422 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:46,422 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:46,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:46,433 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 [2019-10-22 08:59:46,434 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:46,434 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:46,434 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:46,435 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:46,438 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:46,438 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:46,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:46,442 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 [2019-10-22 08:59:46,447 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:46,447 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:46,447 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:46,447 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:46,450 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:46,450 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:46,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:46,486 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 [2019-10-22 08:59:46,486 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:46,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:46,487 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:46,490 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:46,496 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:46,496 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:46,629 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:46,675 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:46,675 INFO L444 ModelExtractionUtils]: 31 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:59:46,678 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:46,682 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:46,682 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:46,683 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-10-22 08:59:46,719 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2019-10-22 08:59:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:46,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:46,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:46,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:46,835 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 [2019-10-22 08:59:46,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-10-22 08:59:46,877 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2019-10-22 08:59:46,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-10-22 08:59:46,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:59:46,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:46,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:59:46,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:46,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:59:46,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:46,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-10-22 08:59:46,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:46,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-10-22 08:59:46,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:59:46,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:59:46,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-10-22 08:59:46,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:46,890 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:59:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-10-22 08:59:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-10-22 08:59:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 08:59:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-10-22 08:59:46,909 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:59:46,909 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-10-22 08:59:46,910 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:46,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-10-22 08:59:46,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:59:46,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:46,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:46,911 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:46,911 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:46,911 INFO L791 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#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; 141#L385 assume !(main_~length~0 < 1); 146#L385-2 assume !(main_~n~0 < 1); 144#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 + (main_~length~0 - 1), 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; 145#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, 1 + cstrncpy_#t~post207.offset;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); 137#L372 assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 139#L375-3 [2019-10-22 08:59:46,911 INFO L793 eck$LassoCheckResult]: Loop: 139#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 142#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; 139#L375-3 [2019-10-22 08:59:46,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-10-22 08:59:46,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:46,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649213960] [2019-10-22 08:59:46,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:46,949 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:46,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:46,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-10-22 08:59:46,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:46,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152053782] [2019-10-22 08:59:46,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:46,958 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:46,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-10-22 08:59:46,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:46,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897290523] [2019-10-22 08:59:46,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:46,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:47,020 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:47,555 WARN L191 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 132 [2019-10-22 08:59:47,755 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-10-22 08:59:47,759 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:47,759 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:47,759 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:47,760 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:47,760 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:47,760 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:47,760 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:47,760 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:47,760 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_mixed_alloca.i_Iteration2_Lasso [2019-10-22 08:59:47,760 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:47,760 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:47,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,099 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-10-22 08:59:48,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,826 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:59:48,880 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:48,880 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:48,880 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 [2019-10-22 08:59:48,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,881 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,882 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,883 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 [2019-10-22 08:59:48,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,884 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,885 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,885 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,885 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,886 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 [2019-10-22 08:59:48,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,886 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,887 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,887 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,887 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,888 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 [2019-10-22 08:59:48,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,889 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,889 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,890 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,890 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,891 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 [2019-10-22 08:59:48,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,892 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,893 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:48,893 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:48,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,895 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 [2019-10-22 08:59:48,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,896 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,897 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,897 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,897 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 [2019-10-22 08:59:48,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,899 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:48,900 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:48,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,909 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 [2019-10-22 08:59:48,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,909 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,910 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,910 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 [2019-10-22 08:59:48,911 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,911 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,911 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,911 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,912 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,912 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 [2019-10-22 08:59:48,913 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,913 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,913 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,913 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,913 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:48,913 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:48,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,915 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 [2019-10-22 08:59:48,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,916 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,916 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,916 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,917 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 [2019-10-22 08:59:48,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,918 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,918 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,918 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,920 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 [2019-10-22 08:59:48,920 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,920 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,921 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,921 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,922 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 [2019-10-22 08:59:48,923 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,923 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,923 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,923 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,924 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,924 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,925 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 [2019-10-22 08:59:48,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,925 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,926 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,926 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,926 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,926 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,927 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 [2019-10-22 08:59:48,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,928 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,928 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,928 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,928 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,929 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,929 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,930 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 [2019-10-22 08:59:48,930 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,930 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,931 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,931 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,932 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 [2019-10-22 08:59:48,932 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,932 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,933 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,933 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,933 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,933 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,933 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,934 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 [2019-10-22 08:59:48,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,935 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,936 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,936 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,936 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,937 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 [2019-10-22 08:59:48,938 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,939 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:48,939 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:48,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,941 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 [2019-10-22 08:59:48,942 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,942 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,942 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:48,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,951 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 08:59:48,951 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:59:49,149 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:49,430 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-10-22 08:59:49,430 INFO L444 ModelExtractionUtils]: 54 out of 66 variables were initially zero. Simplification set additionally 9 variables to zero. [2019-10-22 08:59:49,431 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:49,433 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-10-22 08:59:49,434 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:49,438 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 [] [2019-10-22 08:59:49,490 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-10-22 08:59:49,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:49,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:49,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:49,544 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 [2019-10-22 08:59:49,545 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:59:49,556 INFO L76 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. [2019-10-22 08:59:49,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-10-22 08:59:49,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:59:49,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:49,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:59:49,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:49,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:59:49,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:49,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-10-22 08:59:49,560 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:49,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-10-22 08:59:49,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:49,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:49,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:49,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:49,560 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:49,560 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:49,561 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:49,561 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:49,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:49,561 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:49,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:49,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:49 BoogieIcfgContainer [2019-10-22 08:59:49,573 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:49,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:49,574 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:49,574 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:49,575 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:43" (3/4) ... [2019-10-22 08:59:49,579 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:49,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:49,581 INFO L168 Benchmark]: Toolchain (without parser) took 6654.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 937.8 MB in the beginning and 1.0 GB in the end (delta: -72.6 MB). Peak memory consumption was 129.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:49,582 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:49,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 497.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:49,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:49,584 INFO L168 Benchmark]: Boogie Preprocessor took 29.48 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:49,584 INFO L168 Benchmark]: RCFGBuilder took 333.67 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:49,585 INFO L168 Benchmark]: BuchiAutomizer took 5730.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.1 MB). Peak memory consumption was 140.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:49,586 INFO L168 Benchmark]: Witness Printer took 5.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:49,589 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 497.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.48 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 333.67 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5730.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.1 MB). Peak memory consumption was 140.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 5.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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, 26 SDslu, 9 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital242 mio100 ax100 hnf99 lsp96 ukn86 mio100 lsp34 div100 bol100 ite100 ukn100 eq197 hnf89 smp100 dnf237 smp97 tf100 neg97 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 492ms 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...