./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/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 1a0687c7a9248a5f8cc8ee4c8e4eeb67512aff8e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:41,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:41,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:41,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:41,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:41,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:41,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:41,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:41,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:41,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:41,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:41,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:41,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:41,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:41,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:41,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:41,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:41,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:41,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:41,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:41,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:41,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:41,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:41,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:41,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:41,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:41,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:41,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:41,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:41,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:41,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:41,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:41,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:41,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:41,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:41,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:41,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:41,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:41,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:41,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:41,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:41,553 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:59:41,574 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:41,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:41,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:41,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:41,578 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:41,578 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:41,578 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:41,578 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:41,579 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:41,579 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:41,579 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:41,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:41,579 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:41,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:41,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:41,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:41,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:41,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:41,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:41,580 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:41,580 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:41,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:41,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:41,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:41,581 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:41,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:41,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:41,583 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:41,584 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:41,584 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/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 -> 1a0687c7a9248a5f8cc8ee4c8e4eeb67512aff8e [2019-10-22 08:59:41,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:41,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:41,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:41,638 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:41,638 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:41,639 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i [2019-10-22 08:59:41,683 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/bin/uautomizer/data/b139cbdc5/3632b9c404e949bc9372fbca796407d6/FLAG917d434cd [2019-10-22 08:59:42,160 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:42,167 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i [2019-10-22 08:59:42,190 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/bin/uautomizer/data/b139cbdc5/3632b9c404e949bc9372fbca796407d6/FLAG917d434cd [2019-10-22 08:59:42,667 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/bin/uautomizer/data/b139cbdc5/3632b9c404e949bc9372fbca796407d6 [2019-10-22 08:59:42,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:42,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:42,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:42,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:42,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:42,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb4e5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42, skipping insertion in model container [2019-10-22 08:59:42,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,685 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:42,716 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:43,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:43,094 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:43,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:43,180 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:43,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43 WrapperNode [2019-10-22 08:59:43,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:43,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:43,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:43,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:43,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:43,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:43,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:43,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:43,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... [2019-10-22 08:59:43,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:43,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:43,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:43,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:43,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea38cdd6-e30b-4e55-973f-3d5e8b914c03/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:59:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:59:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:43,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:43,551 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:43,552 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:59:43,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:43 BoogieIcfgContainer [2019-10-22 08:59:43,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:43,553 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:43,554 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:43,557 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:43,557 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:43,558 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:42" (1/3) ... [2019-10-22 08:59:43,559 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d6df9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:43, skipping insertion in model container [2019-10-22 08:59:43,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:43,559 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:43" (2/3) ... [2019-10-22 08:59:43,559 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d6df9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:43, skipping insertion in model container [2019-10-22 08:59:43,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:43,559 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:43" (3/3) ... [2019-10-22 08:59:43,561 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-2.i [2019-10-22 08:59:43,603 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:43,603 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:43,603 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:43,603 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:43,603 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:43,603 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:43,603 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:43,604 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:43,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:59:43,652 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:59:43,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:43,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:43,659 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:43,659 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:43,659 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:43,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:59:43,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:59:43,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:43,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:43,661 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:59:43,661 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:43,668 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15.base, main_#t~ret15.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~nondet11;havoc main_#t~nondet11;main_~n~0 := main_#t~nondet12;havoc main_#t~nondet12; 3#L568true assume !(main_~length~0 < 1); 6#L568-2true assume !(main_~n~0 < 1); 19#L571-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_#in~src.base, cstpncpy_#in~src.offset, cstpncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstpncpy_#res.base, cstpncpy_#res.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset, cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, cstpncpy_#t~mem7, cstpncpy_#t~post9.base, cstpncpy_#t~post9.offset, cstpncpy_#t~pre8, cstpncpy_#t~pre4, cstpncpy_~d~0.base, cstpncpy_~d~0.offset, cstpncpy_~s~0.base, cstpncpy_~s~0.offset, cstpncpy_#t~mem10.base, cstpncpy_#t~mem10.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, cstpncpy_~src.base, cstpncpy_~src.offset, cstpncpy_~n;call cstpncpy_~#dst.base, cstpncpy_~#dst.offset := #Ultimate.allocOnStack(8);call write~$Pointer$(cstpncpy_#in~dst.base, cstpncpy_#in~dst.offset, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8);cstpncpy_~src.base, cstpncpy_~src.offset := cstpncpy_#in~src.base, cstpncpy_#in~src.offset;cstpncpy_~n := cstpncpy_#in~n; 15#L550true assume 0 != cstpncpy_~n % 4294967296;call cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8);cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;havoc cstpncpy_#t~mem2.base, cstpncpy_#t~mem2.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_~src.base, cstpncpy_~src.offset;call cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset := read~$Pointer$(cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8);call write~$Pointer$(cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset + cstpncpy_~n % 4294967296, cstpncpy_~#dst.base, cstpncpy_~#dst.offset, 8);havoc cstpncpy_#t~mem3.base, cstpncpy_#t~mem3.offset; 16#L554-4true [2019-10-22 08:59:43,669 INFO L793 eck$LassoCheckResult]: Loop: 16#L554-4true cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset := cstpncpy_~d~0.base, cstpncpy_~d~0.offset;cstpncpy_~d~0.base, cstpncpy_~d~0.offset := cstpncpy_#t~post5.base, 1 + cstpncpy_#t~post5.offset;cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset := cstpncpy_~s~0.base, cstpncpy_~s~0.offset;cstpncpy_~s~0.base, cstpncpy_~s~0.offset := cstpncpy_#t~post6.base, 1 + cstpncpy_#t~post6.offset;call cstpncpy_#t~mem7 := read~int(cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset, 1);call write~int(cstpncpy_#t~mem7, cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset, 1); 7#L555true assume !(0 == cstpncpy_#t~mem7);havoc cstpncpy_#t~post5.base, cstpncpy_#t~post5.offset;havoc cstpncpy_#t~post6.base, cstpncpy_#t~post6.offset;havoc cstpncpy_#t~mem7; 10#L554-1true cstpncpy_#t~pre4 := cstpncpy_~n - 1;cstpncpy_~n := cstpncpy_~n - 1; 13#L554-2true assume !!(0 != cstpncpy_#t~pre4 % 4294967296);havoc cstpncpy_#t~pre4; 16#L554-4true [2019-10-22 08:59:43,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,674 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2019-10-22 08:59:43,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78209685] [2019-10-22 08:59:43,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,919 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:43,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1618712, now seen corresponding path program 1 times [2019-10-22 08:59:43,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011676450] [2019-10-22 08:59:43,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,951 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:43,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1592246563, now seen corresponding path program 1 times [2019-10-22 08:59:43,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280782111] [2019-10-22 08:59:43,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,117 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:44,263 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-10-22 08:59:45,547 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 164 DAG size of output: 152 [2019-10-22 08:59:45,607 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:45,970 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-10-22 08:59:45,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:45,982 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:46,305 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-10-22 08:59:46,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:46,315 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:46,638 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-10-22 08:59:46,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:46,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:46,641 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:279, output treesize:266 [2019-10-22 08:59:46,904 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-10-22 08:59:46,917 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:46,918 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:46,918 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:46,918 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:46,918 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:46,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:46,919 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:46,919 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:46,919 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpncpy-alloca-2.i_Iteration1_Lasso [2019-10-22 08:59:46,919 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:46,919 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:46,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:46,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,442 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2019-10-22 08:59:47,693 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-10-22 08:59:47,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:47,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-10-22 08:59:47,921 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-22 08:59:48,053 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-22 08:59:48,853 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-10-22 08:59:48,957 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:48,961 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:48,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:48,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,965 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,966 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,968 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,968 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:48,971 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,971 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,971 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,972 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,972 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,972 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:48,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,976 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:48,976 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:48,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:48,980 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,980 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,981 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,981 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:48,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,984 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,984 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:48,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,986 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,986 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,987 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:48,987 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:48,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:48,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,992 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:48,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,992 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,993 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:48,993 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:48,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:48,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:48,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:48,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:48,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:48,996 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:48,996 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:48,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:48,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,000 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,000 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,000 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,000 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,001 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,003 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,003 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,003 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,005 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,005 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,006 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,006 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,006 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,008 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,008 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,008 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,011 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,011 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,011 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,012 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,012 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,013 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,013 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,014 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,014 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,015 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,015 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,015 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,016 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,016 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,016 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,021 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,021 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,022 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,022 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,022 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,024 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,028 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,029 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,034 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,035 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,036 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,036 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,036 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,036 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,037 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,038 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,038 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,038 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,038 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,039 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,039 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,039 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,043 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,044 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:49,045 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:49,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,056 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,056 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,057 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,057 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,059 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:49,059 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,060 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:49,060 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:49,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:49,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:49,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:49,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:49,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:49,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:49,075 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:49,075 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:49,261 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:49,308 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:49,310 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:59:49,312 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:49,313 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:49,314 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:49,314 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstpncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_cstpncpy_~d~0.base)_1) = -1*ULTIMATE.start_cstpncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_cstpncpy_~d~0.base)_1 Supporting invariants [] [2019-10-22 08:59:49,383 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2019-10-22 08:59:49,391 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:49,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:49,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:59:49,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:49,486 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:49,487 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-10-22 08:59:49,531 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 40 states and 49 transitions. Complement of second has 5 states. [2019-10-22 08:59:49,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2019-10-22 08:59:49,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:59:49,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:49,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:59:49,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:49,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 6 letters. Loop has 8 letters. [2019-10-22 08:59:49,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:49,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2019-10-22 08:59:49,540 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:49,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2019-10-22 08:59:49,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:49,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:49,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:49,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:49,543 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:49,544 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:49,544 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:49,544 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:49,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:49,544 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:49,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:49,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:49 BoogieIcfgContainer [2019-10-22 08:59:49,551 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:49,551 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:49,551 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:49,551 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:49,552 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:43" (3/4) ... [2019-10-22 08:59:49,555 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:49,555 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:49,556 INFO L168 Benchmark]: Toolchain (without parser) took 6884.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:49,556 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:49,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 508.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:49,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:49,557 INFO L168 Benchmark]: Boogie Preprocessor took 30.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:49,558 INFO L168 Benchmark]: RCFGBuilder took 304.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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:49,558 INFO L168 Benchmark]: BuchiAutomizer took 5997.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.2 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:49,559 INFO L168 Benchmark]: Witness Printer took 3.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:49,561 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 508.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 304.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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5997.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.2 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[d] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 23 SDslu, 9 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital379 mio100 ax104 hnf99 lsp93 ukn67 mio100 lsp45 div164 bol100 ite100 ukn100 eq176 hnf70 smp94 dnf270 smp95 tf100 neg95 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...