./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_malloc.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/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_malloc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/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 7c56c09a74d2fc3893706afbe8a4ee36044dd617 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:12:35,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:12:35,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:12:35,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:12:35,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:12:35,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:12:35,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:12:35,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:12:35,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:12:35,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:12:35,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:12:35,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:12:35,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:12:35,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:12:35,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:12:35,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:12:35,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:12:35,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:12:35,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:12:35,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:12:35,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:12:35,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:12:35,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:12:35,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:12:35,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:12:35,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:12:35,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:12:35,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:12:35,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:12:35,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:12:35,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:12:35,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:12:35,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:12:35,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:12:35,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:12:35,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:12:35,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:12:35,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:12:35,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:12:35,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:12:35,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:12:35,865 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:12:35,893 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:12:35,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:12:35,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:12:35,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:12:35,904 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:12:35,904 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:12:35,904 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:12:35,905 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:12:35,905 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:12:35,905 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:12:35,905 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:12:35,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:12:35,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:12:35,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:12:35,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:12:35,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:12:35,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:12:35,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:12:35,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:12:35,908 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:12:35,908 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:12:35,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:12:35,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:12:35,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:12:35,909 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:12:35,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:12:35,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:12:35,910 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:12:35,911 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:12:35,913 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/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/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 -> 7c56c09a74d2fc3893706afbe8a4ee36044dd617 [2019-11-16 00:12:35,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:12:35,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:12:35,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:12:35,960 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:12:35,961 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:12:35,962 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_malloc.i [2019-11-16 00:12:36,023 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/bin/uautomizer/data/627c3a0fd/a1a4dc6a027e46a0b8afee09c9c53b0f/FLAGcd0938ee6 [2019-11-16 00:12:36,458 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:12:36,458 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/sv-benchmarks/c/termination-15/cstrncpy_malloc.i [2019-11-16 00:12:36,467 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/bin/uautomizer/data/627c3a0fd/a1a4dc6a027e46a0b8afee09c9c53b0f/FLAGcd0938ee6 [2019-11-16 00:12:36,480 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/bin/uautomizer/data/627c3a0fd/a1a4dc6a027e46a0b8afee09c9c53b0f [2019-11-16 00:12:36,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:12:36,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:12:36,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:36,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:12:36,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:12:36,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:36" (1/1) ... [2019-11-16 00:12:36,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60b3a028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36, skipping insertion in model container [2019-11-16 00:12:36,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:12:36" (1/1) ... [2019-11-16 00:12:36,498 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:12:36,532 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:12:36,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:36,856 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:12:36,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:12:36,955 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:12:36,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36 WrapperNode [2019-11-16 00:12:36,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:12:36,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:12:36,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:12:36,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:12:36,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36" (1/1) ... [2019-11-16 00:12:36,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36" (1/1) ... [2019-11-16 00:12:36,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:12:36,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:12:36,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:12:36,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:12:37,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36" (1/1) ... [2019-11-16 00:12:37,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36" (1/1) ... [2019-11-16 00:12:37,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36" (1/1) ... [2019-11-16 00:12:37,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36" (1/1) ... [2019-11-16 00:12:37,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36" (1/1) ... [2019-11-16 00:12:37,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36" (1/1) ... [2019-11-16 00:12:37,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36" (1/1) ... [2019-11-16 00:12:37,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:12:37,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:12:37,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:12:37,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:12:37,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_91f733c7-7db6-462b-a02f-8ffdc49e44c0/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-11-16 00:12:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:12:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:12:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:12:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:12:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:12:37,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:12:37,334 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:12:37,334 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:12:37,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:37 BoogieIcfgContainer [2019-11-16 00:12:37,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:12:37,336 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:12:37,336 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:12:37,339 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:12:37,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:12:37,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:12:36" (1/3) ... [2019-11-16 00:12:37,341 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78c55447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:12:37, skipping insertion in model container [2019-11-16 00:12:37,341 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:12:37,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:12:36" (2/3) ... [2019-11-16 00:12:37,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78c55447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:12:37, skipping insertion in model container [2019-11-16 00:12:37,342 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:12:37,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:37" (3/3) ... [2019-11-16 00:12:37,343 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncpy_malloc.i [2019-11-16 00:12:37,383 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:12:37,383 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:12:37,383 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:12:37,383 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:12:37,383 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:12:37,383 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:12:37,383 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:12:37,383 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:12:37,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-16 00:12:37,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:12:37,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:37,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:37,446 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:12:37,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:12:37,446 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:12:37,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-16 00:12:37,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-16 00:12:37,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:37,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:37,448 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:12:37,448 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:12:37,456 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.allocOnHeap(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.allocOnHeap(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);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-11-16 00:12:37,456 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, 1 + cstrncpy_#t~post206.offset;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~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset; 14#L370-2true [2019-11-16 00:12:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-16 00:12:37,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:37,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106545062] [2019-11-16 00:12:37,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:37,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:37,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:37,634 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:37,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-11-16 00:12:37,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:37,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122637916] [2019-11-16 00:12:37,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:37,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:37,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:37,662 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:37,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:37,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-11-16 00:12:37,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:37,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677213366] [2019-11-16 00:12:37,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:37,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:37,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:37,784 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:37,917 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-16 00:12:38,431 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-11-16 00:12:38,582 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-16 00:12:38,593 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:12:38,596 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:12:38,596 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:12:38,596 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:12:38,596 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:12:38,597 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:12:38,597 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:12:38,598 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:12:38,598 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc.i_Iteration1_Lasso [2019-11-16 00:12:38,598 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:12:38,598 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:12:38,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:38,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:39,083 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-11-16 00:12:39,284 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-16 00:12:39,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:39,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:39,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:39,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:40,128 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:12:40,226 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:12:40,231 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:12:40,233 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-11-16 00:12:40,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,235 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,236 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,236 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,241 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-11-16 00:12:40,242 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,242 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,243 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,243 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,243 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,245 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-11-16 00:12:40,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,245 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,246 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,247 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,247 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,248 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-11-16 00:12:40,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,252 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:40,252 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:40,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,255 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-11-16 00:12:40,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,259 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:40,259 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:40,262 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,262 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-11-16 00:12:40,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,263 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,264 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,265 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,266 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-11-16 00:12:40,266 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,266 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,267 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,269 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-11-16 00:12:40,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,270 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,270 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,270 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,271 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,271 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,272 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-11-16 00:12:40,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,273 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,274 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,274 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,275 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-11-16 00:12:40,276 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,276 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,276 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,277 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,277 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,278 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-11-16 00:12:40,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,279 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,280 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,280 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,281 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,282 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-11-16 00:12:40,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,283 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,284 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,284 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,285 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-11-16 00:12:40,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,286 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,287 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,287 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,287 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,287 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,289 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-11-16 00:12:40,289 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,289 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,290 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,290 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,291 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,292 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-11-16 00:12:40,292 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,293 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,294 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,294 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,295 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-11-16 00:12:40,296 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,296 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,296 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,296 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,296 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,297 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,297 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,298 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-11-16 00:12:40,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,299 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,299 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,299 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,299 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,300 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,300 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,301 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-11-16 00:12:40,302 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,302 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:40,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,303 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:40,303 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:40,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:40,305 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-11-16 00:12:40,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:40,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:40,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:40,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:40,312 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:40,312 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:40,397 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:12:40,441 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:12:40,441 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-16 00:12:40,443 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:12:40,445 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:12:40,445 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:12:40,446 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-11-16 00:12:40,482 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-11-16 00:12:40,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:40,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:12:40,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:40,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:12:40,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:40,586 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-11-16 00:12:40,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-11-16 00:12:40,631 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-11-16 00:12:40,631 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-11-16 00:12:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:12:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-16 00:12:40,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:12:40,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:40,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:12:40,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:40,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:12:40,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:40,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-11-16 00:12:40,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:12:40,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-11-16 00:12:40,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:12:40,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-16 00:12:40,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-16 00:12:40,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:12:40,649 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-16 00:12:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-16 00:12:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-16 00:12:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:12:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-16 00:12:40,674 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:12:40,674 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:12:40,674 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:12:40,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-16 00:12:40,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:12:40,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:12:40,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:12:40,677 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:12:40,677 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:12:40,677 INFO L791 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#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; 145#L385 assume !(main_~length~0 < 1); 150#L385-2 assume !(main_~n~0 < 1); 148#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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);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; 149#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, 1 + cstrncpy_#t~post206.offset;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); 141#L372 assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 143#L375-3 [2019-11-16 00:12:40,678 INFO L793 eck$LassoCheckResult]: Loop: 143#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 146#L375-1 assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, 1 + cstrncpy_#t~post210.offset;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 143#L375-3 [2019-11-16 00:12:40,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-11-16 00:12:40,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:40,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329503791] [2019-11-16 00:12:40,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:40,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:40,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:40,753 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:40,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:40,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-11-16 00:12:40,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:40,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061840103] [2019-11-16 00:12:40,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:40,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:40,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:40,774 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:40,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:40,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-11-16 00:12:40,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:12:40,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111724241] [2019-11-16 00:12:40,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:40,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:12:40,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:12:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:12:40,843 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:12:41,521 WARN L191 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 127 [2019-11-16 00:12:41,691 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-16 00:12:41,696 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:12:41,696 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:12:41,696 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:12:41,696 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:12:41,697 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:12:41,697 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:12:41,697 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:12:41,697 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:12:41,697 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc.i_Iteration2_Lasso [2019-11-16 00:12:41,697 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:12:41,697 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:12:41,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:41,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:42,146 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2019-11-16 00:12:42,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:42,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:42,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:42,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:42,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:12:42,990 WARN L191 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-16 00:12:43,203 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:12:43,203 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:12:43,204 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-11-16 00:12:43,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,205 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,205 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,205 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,206 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,206 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,207 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-11-16 00:12:43,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,207 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,207 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,207 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,208 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,208 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,209 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-11-16 00:12:43,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,214 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,215 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,216 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,217 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-11-16 00:12:43,217 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,217 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,217 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,217 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,217 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,218 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,218 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,219 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-11-16 00:12:43,220 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,220 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,221 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:43,222 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:43,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,225 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-11-16 00:12:43,226 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,226 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,226 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,226 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,226 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,227 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,227 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,228 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-11-16 00:12:43,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,229 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,233 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,233 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,234 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,234 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,234 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-11-16 00:12:43,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,235 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,236 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,236 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,237 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-11-16 00:12:43,238 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,240 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:43,240 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:43,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,243 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-11-16 00:12:43,244 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,244 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,244 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,244 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,245 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,245 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,245 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,249 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-11-16 00:12:43,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,250 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,251 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,251 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,251 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,252 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-11-16 00:12:43,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,253 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,254 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,254 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,254 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,254 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,255 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-11-16 00:12:43,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,256 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,261 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,261 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,262 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,262 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,263 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-11-16 00:12:43,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,264 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,268 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,269 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-11-16 00:12:43,270 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,270 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:12:43,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,271 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,283 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:12:43,283 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:43,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,337 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-11-16 00:12:43,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,338 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,346 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:43,346 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:43,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,350 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-11-16 00:12:43,351 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,352 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,352 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:43,352 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:43,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,361 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-11-16 00:12:43,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,363 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:43,363 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:43,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,365 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-11-16 00:12:43,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,367 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:43,367 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:43,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,369 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-11-16 00:12:43,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:12:43,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,370 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,370 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:12:43,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:12:43,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,371 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-11-16 00:12:43,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,372 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:12:43,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,373 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:12:43,374 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:12:43,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:12:43,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:12:43,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:12:43,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:12:43,387 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:12:43,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:12:43,397 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-16 00:12:43,397 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:12:43,716 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:12:44,053 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-16 00:12:44,053 INFO L444 ModelExtractionUtils]: 78 out of 91 variables were initially zero. Simplification set additionally 10 variables to zero. [2019-11-16 00:12:44,054 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:12:44,055 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-16 00:12:44,056 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:12:44,056 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2 Supporting invariants [] [2019-11-16 00:12:44,110 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-11-16 00:12:44,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:12:44,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:12:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:44,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-16 00:12:44,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:12:44,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:12:44,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:12:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:12:44,200 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-11-16 00:12:44,200 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-16 00:12:44,243 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2019-11-16 00:12:44,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:12:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:12:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-16 00:12:44,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:12:44,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:44,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-16 00:12:44,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:44,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-16 00:12:44,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:12:44,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-11-16 00:12:44,247 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:12:44,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-11-16 00:12:44,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:12:44,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:12:44,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:12:44,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:12:44,247 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:12:44,247 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:12:44,247 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:12:44,247 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:12:44,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:12:44,248 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:12:44,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:12:44,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:12:44 BoogieIcfgContainer [2019-11-16 00:12:44,254 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:12:44,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:12:44,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:12:44,254 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:12:44,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:12:37" (3/4) ... [2019-11-16 00:12:44,258 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:12:44,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:12:44,259 INFO L168 Benchmark]: Toolchain (without parser) took 7775.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 941.1 MB in the beginning and 912.9 MB in the end (delta: 28.2 MB). Peak memory consumption was 214.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:44,260 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:12:44,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:44,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:44,262 INFO L168 Benchmark]: Boogie Preprocessor took 25.77 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:44,262 INFO L168 Benchmark]: RCFGBuilder took 311.97 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:44,263 INFO L168 Benchmark]: BuchiAutomizer took 6917.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 912.9 MB in the end (delta: 171.9 MB). Peak memory consumption was 222.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:12:44,263 INFO L168 Benchmark]: Witness Printer took 3.97 ms. Allocated memory is still 1.2 GB. Free memory is still 912.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:12:44,270 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 470.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.77 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 311.97 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6917.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 912.9 MB in the end (delta: 171.9 MB). Peak memory consumption was 222.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.97 ms. Allocated memory is still 1.2 GB. Free memory is still 912.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 -1 * us + unknown-#length-unknown[malloc(n * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 6.4s. 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: 24 SDtfs, 24 SDslu, 14 SDs, 0 SdLazy, 9 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax100 hnf99 lsp97 ukn86 mio100 lsp40 div100 bol100 ite100 ukn100 eq199 hnf89 smp100 dnf223 smp97 tf100 neg97 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 670ms VariablesStem: 17 VariablesLoop: 11 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...