./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcpy_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcpy_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/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 ca73807de0c8f7d87fbb77e097710eeb5024a6fe ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:49:49,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:49:49,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:49:49,495 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:49:49,495 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:49:49,496 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:49:49,497 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:49:49,498 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:49:49,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:49:49,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:49:49,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:49:49,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:49:49,501 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:49:49,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:49:49,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:49:49,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:49:49,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:49:49,504 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:49:49,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:49:49,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:49:49,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:49:49,507 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:49:49,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:49:49,509 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:49:49,509 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:49:49,510 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:49:49,510 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:49:49,511 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:49:49,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:49:49,512 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:49:49,512 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:49:49,513 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:49:49,513 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:49:49,513 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:49:49,514 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:49:49,514 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:49:49,514 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 11:49:49,522 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:49:49,522 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:49:49,523 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:49:49,523 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:49:49,524 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:49:49,524 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:49:49,524 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:49:49,524 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:49:49,524 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:49:49,524 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:49:49,525 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:49:49,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:49:49,525 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:49:49,525 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:49:49,525 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:49:49,525 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:49:49,526 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:49:49,526 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:49:49,526 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:49:49,526 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:49:49,526 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:49:49,526 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:49:49,526 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:49:49,527 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:49:49,527 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:49:49,527 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:49:49,527 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:49:49,528 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:49:49,528 INFO L133 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_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/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 -> ca73807de0c8f7d87fbb77e097710eeb5024a6fe [2018-11-10 11:49:49,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:49:49,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:49:49,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:49:49,559 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:49:49,560 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:49:49,560 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcpy_diffterm_alloca_true-termination.c.i [2018-11-10 11:49:49,595 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/uautomizer/data/2ea3f7cf7/e9b80361da6e44f093b6302812324429/FLAGb6981ef1e [2018-11-10 11:49:49,919 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:49:49,919 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/sv-benchmarks/c/termination-15/cstrcpy_diffterm_alloca_true-termination.c.i [2018-11-10 11:49:49,924 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/uautomizer/data/2ea3f7cf7/e9b80361da6e44f093b6302812324429/FLAGb6981ef1e [2018-11-10 11:49:49,933 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/uautomizer/data/2ea3f7cf7/e9b80361da6e44f093b6302812324429 [2018-11-10 11:49:49,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:49:49,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:49:49,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:49:49,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:49:49,939 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:49:49,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:49:49" (1/1) ... [2018-11-10 11:49:49,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af148b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:49, skipping insertion in model container [2018-11-10 11:49:49,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:49:49" (1/1) ... [2018-11-10 11:49:49,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:49:49,972 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:49:50,157 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:49:50,165 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:49:50,194 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:49:50,236 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:49:50,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:50 WrapperNode [2018-11-10 11:49:50,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:49:50,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:49:50,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:49:50,238 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:49:50,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:50" (1/1) ... [2018-11-10 11:49:50,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:50" (1/1) ... [2018-11-10 11:49:50,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:49:50,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:49:50,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:49:50,310 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:49:50,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:50" (1/1) ... [2018-11-10 11:49:50,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:50" (1/1) ... [2018-11-10 11:49:50,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:50" (1/1) ... [2018-11-10 11:49:50,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:50" (1/1) ... [2018-11-10 11:49:50,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:50" (1/1) ... [2018-11-10 11:49:50,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:50" (1/1) ... [2018-11-10 11:49:50,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:50" (1/1) ... [2018-11-10 11:49:50,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:49:50,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:49:50,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:49:50,328 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:49:50,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0777a73e-473f-47c9-800a-7aa9b7a55e20/bin-2019/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 [2018-11-10 11:49:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:49:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:49:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:49:50,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:49:50,525 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:49:50,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:49:50 BoogieIcfgContainer [2018-11-10 11:49:50,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:49:50,526 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:49:50,526 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:49:50,529 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:49:50,530 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:49:50,530 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:49:49" (1/3) ... [2018-11-10 11:49:50,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41d5743f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:49:50, skipping insertion in model container [2018-11-10 11:49:50,531 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:49:50,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:50" (2/3) ... [2018-11-10 11:49:50,533 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41d5743f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:49:50, skipping insertion in model container [2018-11-10 11:49:50,533 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:49:50,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:49:50" (3/3) ... [2018-11-10 11:49:50,534 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcpy_diffterm_alloca_true-termination.c.i [2018-11-10 11:49:50,580 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:49:50,581 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:49:50,581 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:49:50,581 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:49:50,582 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:49:50,582 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:49:50,582 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:49:50,582 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:49:50,582 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:49:50,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-10 11:49:50,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 11:49:50,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:49:50,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:49:50,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:49:50,614 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:49:50,614 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:49:50,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-10 11:49:50,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 11:49:50,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:49:50,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:49:50,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:49:50,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:49:50,623 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet208, main_#t~nondet209, main_#t~malloc210.base, main_#t~malloc210.offset, main_#t~malloc211.base, main_#t~malloc211.offset, main_#t~ret212.base, main_#t~ret212.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet208;havoc main_#t~nondet208;main_~length2~0 := main_#t~nondet209;havoc main_#t~nondet209; 7#L375true assume !(main_~length1~0 < 1); 10#L375-2true assume !(main_~length2~0 < 1); 3#L378-1true assume !(main_~length1~0 < main_~length2~0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc210.base, main_#t~malloc210.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc210.base, main_#t~malloc210.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc211.base, main_#t~malloc211.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc211.base, main_#t~malloc211.offset; 9#L384true SUMMARY for call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L384 12#L384-1true assume { :begin_inline_cstrcpy } true;cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset, cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset, cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset, cstrcpy_#t~mem207, cstrcpy_~s1.base, cstrcpy_~s1.offset, cstrcpy_~s2.base, cstrcpy_~s2.offset, cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset, cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~s1.base, cstrcpy_~s1.offset := cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset;cstrcpy_~s2.base, cstrcpy_~s2.offset := cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_~s1.base, cstrcpy_~s1.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_~s2.base, cstrcpy_~s2.offset; 11#L368-6true [2018-11-10 11:49:50,623 INFO L795 eck$LassoCheckResult]: Loop: 11#L368-6true assume true; 19#L368-1true cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset := cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset + 1;cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset := cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset + 1; 4#L368-2true SUMMARY for call cstrcpy_#t~mem207 := read~int(cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset, 1); srcloc: L368-2 5#L368-3true SUMMARY for call write~int(cstrcpy_#t~mem207, cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset, 1); srcloc: L368-3 8#L368-4true assume !!(cstrcpy_#t~mem207 != 49);havoc cstrcpy_#t~mem207;havoc cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset;havoc cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset; 11#L368-6true [2018-11-10 11:49:50,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:49:50,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939467, now seen corresponding path program 1 times [2018-11-10 11:49:50,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:49:50,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:49:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:50,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:49:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:49:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:49:50,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:49:50,733 INFO L82 PathProgramCache]: Analyzing trace with hash 52549374, now seen corresponding path program 1 times [2018-11-10 11:49:50,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:49:50,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:49:50,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:50,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:49:50,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:49:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:49:50,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:49:50,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1253957620, now seen corresponding path program 1 times [2018-11-10 11:49:50,750 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:49:50,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:49:50,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:50,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:49:50,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:49:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:49:51,102 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2018-11-10 11:49:51,206 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:49:51,207 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:49:51,207 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:49:51,207 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:49:51,208 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:49:51,208 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:49:51,208 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:49:51,208 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:49:51,208 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcpy_diffterm_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 11:49:51,208 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:49:51,209 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:49:51,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,524 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2018-11-10 11:49:51,665 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2018-11-10 11:49:51,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:51,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:49:52,075 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:49:52,079 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:49:52,081 INFO L122 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 [2018-11-10 11:49:52,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:49:52,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:49:52,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:49:52,087 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,087 INFO L122 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 [2018-11-10 11:49:52,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:49:52,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:49:52,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:49:52,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,090 INFO L122 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 [2018-11-10 11:49:52,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:49:52,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:49:52,096 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,097 INFO L122 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 [2018-11-10 11:49:52,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:49:52,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:49:52,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:49:52,099 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,099 INFO L122 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 [2018-11-10 11:49:52,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:49:52,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:49:52,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:49:52,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,102 INFO L122 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 [2018-11-10 11:49:52,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:49:52,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:49:52,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,106 INFO L122 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 [2018-11-10 11:49:52,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:49:52,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:49:52,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:49:52,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,108 INFO L122 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 [2018-11-10 11:49:52,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:49:52,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:49:52,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:49:52,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,110 INFO L122 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 [2018-11-10 11:49:52,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:49:52,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:49:52,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:49:52,111 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,112 INFO L122 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 [2018-11-10 11:49:52,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:49:52,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:49:52,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:49:52,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,114 INFO L122 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 [2018-11-10 11:49:52,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:49:52,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:49:52,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:49:52,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,116 INFO L122 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 [2018-11-10 11:49:52,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:49:52,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:49:52,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,127 INFO L122 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 [2018-11-10 11:49:52,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:49:52,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:49:52,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,137 INFO L122 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 [2018-11-10 11:49:52,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:49:52,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:49:52,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,142 INFO L122 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 [2018-11-10 11:49:52,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:49:52,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:49:52,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:49:52,161 INFO L122 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 [2018-11-10 11:49:52,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:49:52,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:49:52,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:49:52,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:49:52,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:49:52,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:49:52,209 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:49:52,239 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 11:49:52,239 INFO L444 ModelExtractionUtils]: 59 out of 64 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 11:49:52,240 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:49:52,241 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:49:52,242 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:49:52,242 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcpy_~dst~0.offset, v_rep(select #length ULTIMATE.start_cstrcpy_~dst~0.base)_1) = -1*ULTIMATE.start_cstrcpy_~dst~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrcpy_~dst~0.base)_1 Supporting invariants [] [2018-11-10 11:49:52,285 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-10 11:49:52,289 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 11:49:52,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:49:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:49:52,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:49:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:49:52,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:49:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:49:52,372 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 11:49:52,373 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 5 states. [2018-11-10 11:49:52,421 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 5 states. Result 36 states and 40 transitions. Complement of second has 7 states. [2018-11-10 11:49:52,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:49:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 11:49:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-10 11:49:52,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 11:49:52,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:49:52,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 11:49:52,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:49:52,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-10 11:49:52,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:49:52,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2018-11-10 11:49:52,431 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:49:52,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-11-10 11:49:52,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:49:52,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:49:52,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:49:52,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:49:52,434 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:49:52,434 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:49:52,434 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:49:52,434 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:49:52,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:49:52,435 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:49:52,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:49:52,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:49:52 BoogieIcfgContainer [2018-11-10 11:49:52,440 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:49:52,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:49:52,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:49:52,441 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:49:52,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:49:50" (3/4) ... [2018-11-10 11:49:52,444 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:49:52,444 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:49:52,444 INFO L168 Benchmark]: Toolchain (without parser) took 2509.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 956.6 MB in the beginning and 949.5 MB in the end (delta: 7.0 MB). Peak memory consumption was 147.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:49:52,445 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:49:52,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.83 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.6 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:49:52,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -207.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:49:52,446 INFO L168 Benchmark]: Boogie Preprocessor took 17.65 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:49:52,447 INFO L168 Benchmark]: RCFGBuilder took 198.20 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:49:52,447 INFO L168 Benchmark]: BuchiAutomizer took 1913.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 949.5 MB in the end (delta: 167.5 MB). Peak memory consumption was 167.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:49:52,447 INFO L168 Benchmark]: Witness Printer took 3.86 ms. Allocated memory is still 1.2 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:49:52,452 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.83 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.6 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -207.1 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.65 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 198.20 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1913.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 949.5 MB in the end (delta: 167.5 MB). Peak memory consumption was 167.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.86 ms. Allocated memory is still 1.2 GB. Free memory is still 949.5 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * dst + unknown-#length-unknown[dst] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. 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: 19 SDtfs, 19 SDslu, 12 SDs, 0 SdLazy, 7 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital211 mio100 ax100 hnf99 lsp97 ukn116 mio100 lsp45 div100 bol100 ite100 ukn100 eq203 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 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...