./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_reverse_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_20998d71-028f-4d48-a3d5-3fb58f45ae2e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_20998d71-028f-4d48-a3d5-3fb58f45ae2e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_20998d71-028f-4d48-a3d5-3fb58f45ae2e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_20998d71-028f-4d48-a3d5-3fb58f45ae2e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_20998d71-028f-4d48-a3d5-3fb58f45ae2e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_20998d71-028f-4d48-a3d5-3fb58f45ae2e/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 cd1d6be80620224d07434e02e12c771f8c62f3e2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 06:59:33,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:59:33,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:59:33,321 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:59:33,321 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:59:33,322 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:59:33,322 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:59:33,324 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:59:33,325 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:59:33,325 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:59:33,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:59:33,326 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:59:33,327 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:59:33,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:59:33,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:59:33,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:59:33,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:59:33,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:59:33,332 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:59:33,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:59:33,333 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:59:33,334 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:59:33,336 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:59:33,336 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:59:33,336 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:59:33,337 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:59:33,337 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:59:33,338 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:59:33,338 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:59:33,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:59:33,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:59:33,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:59:33,340 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:59:33,340 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:59:33,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:59:33,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:59:33,342 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_20998d71-028f-4d48-a3d5-3fb58f45ae2e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 06:59:33,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:59:33,353 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:59:33,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:59:33,354 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:59:33,354 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:59:33,354 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:59:33,354 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:59:33,354 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:59:33,354 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:59:33,354 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:59:33,355 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:59:33,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:59:33,355 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:59:33,355 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:59:33,355 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:59:33,355 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:59:33,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:59:33,355 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:59:33,356 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:59:33,356 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:59:33,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:59:33,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:59:33,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:59:33,356 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:59:33,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:59:33,356 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:59:33,356 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:59:33,357 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:59:33,357 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_20998d71-028f-4d48-a3d5-3fb58f45ae2e/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 -> cd1d6be80620224d07434e02e12c771f8c62f3e2 [2018-11-10 06:59:33,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:59:33,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:59:33,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:59:33,392 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:59:33,392 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:59:33,393 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_20998d71-028f-4d48-a3d5-3fb58f45ae2e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca_true-termination.c.i [2018-11-10 06:59:33,428 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20998d71-028f-4d48-a3d5-3fb58f45ae2e/bin-2019/uautomizer/data/66d38532f/6d4033804bac490f896c37ba71e13a49/FLAGddea913c5 [2018-11-10 06:59:33,855 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:59:33,855 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_20998d71-028f-4d48-a3d5-3fb58f45ae2e/sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca_true-termination.c.i [2018-11-10 06:59:33,862 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20998d71-028f-4d48-a3d5-3fb58f45ae2e/bin-2019/uautomizer/data/66d38532f/6d4033804bac490f896c37ba71e13a49/FLAGddea913c5 [2018-11-10 06:59:33,871 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_20998d71-028f-4d48-a3d5-3fb58f45ae2e/bin-2019/uautomizer/data/66d38532f/6d4033804bac490f896c37ba71e13a49 [2018-11-10 06:59:33,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:59:33,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:59:33,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:59:33,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:59:33,876 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:59:33,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:59:33" (1/1) ... [2018-11-10 06:59:33,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc45616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:33, skipping insertion in model container [2018-11-10 06:59:33,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:59:33" (1/1) ... [2018-11-10 06:59:33,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:59:33,915 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:59:34,117 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:59:34,123 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:59:34,156 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:59:34,198 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:59:34,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:34 WrapperNode [2018-11-10 06:59:34,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:59:34,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:59:34,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:59:34,200 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:59:34,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:34" (1/1) ... [2018-11-10 06:59:34,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:34" (1/1) ... [2018-11-10 06:59:34,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:59:34,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:59:34,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:59:34,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:59:34,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:34" (1/1) ... [2018-11-10 06:59:34,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:34" (1/1) ... [2018-11-10 06:59:34,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:34" (1/1) ... [2018-11-10 06:59:34,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:34" (1/1) ... [2018-11-10 06:59:34,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:34" (1/1) ... [2018-11-10 06:59:34,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:34" (1/1) ... [2018-11-10 06:59:34,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:34" (1/1) ... [2018-11-10 06:59:34,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:59:34,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:59:34,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:59:34,303 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:59:34,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20998d71-028f-4d48-a3d5-3fb58f45ae2e/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 06:59:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 06:59:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 06:59:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:59:34,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:59:34,502 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:59:34,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:59:34 BoogieIcfgContainer [2018-11-10 06:59:34,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:59:34,503 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:59:34,503 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:59:34,505 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:59:34,506 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:59:34,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:59:33" (1/3) ... [2018-11-10 06:59:34,506 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bd7277d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:59:34, skipping insertion in model container [2018-11-10 06:59:34,506 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:59:34,507 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:59:34" (2/3) ... [2018-11-10 06:59:34,507 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bd7277d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:59:34, skipping insertion in model container [2018-11-10 06:59:34,507 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:59:34,507 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:59:34" (3/3) ... [2018-11-10 06:59:34,508 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_reverse_alloca_true-termination.c.i [2018-11-10 06:59:34,541 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:59:34,541 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:59:34,541 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:59:34,541 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:59:34,541 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:59:34,541 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:59:34,541 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:59:34,541 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:59:34,541 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:59:34,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 06:59:34,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 06:59:34,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:59:34,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:59:34,570 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:59:34,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:59:34,570 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:59:34,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 06:59:34,571 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 06:59:34,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:59:34,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:59:34,572 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:59:34,572 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:59:34,578 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 8#L385true assume !(main_~length~0 < 1); 11#L385-2true assume !(main_~n~0 < 1); 4#L388-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~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~malloc213.base, main_#t~malloc213.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~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc214.base, main_#t~malloc214.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~malloc214.base, main_#t~malloc214.offset; 14#L393true SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + 0, 1); srcloc: L393 18#L393-1true main_~nondetString~0.base, main_~nondetString~0.offset := main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1) * 1;assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 24#L370-3true [2018-11-10 06:59:34,579 INFO L795 eck$LassoCheckResult]: Loop: 24#L370-3true assume true; 22#L370-1true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset - 1; 13#L372true SUMMARY for call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1); srcloc: L372 16#L372-1true SUMMARY for call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); srcloc: L372-1 19#L372-2true assume !(cstrncpy_#t~mem208 == 0);havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset; 24#L370-3true [2018-11-10 06:59:34,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:34,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935495, now seen corresponding path program 1 times [2018-11-10 06:59:34,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:34,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:34,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:34,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:34,684 INFO L82 PathProgramCache]: Analyzing trace with hash 48855306, now seen corresponding path program 1 times [2018-11-10 06:59:34,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:34,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:34,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:34,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:34,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:34,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:34,703 INFO L82 PathProgramCache]: Analyzing trace with hash -795574524, now seen corresponding path program 1 times [2018-11-10 06:59:34,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:34,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:34,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:34,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:34,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:35,107 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2018-11-10 06:59:35,199 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:59:35,200 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:59:35,200 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:59:35,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:59:35,200 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:59:35,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:59:35,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:59:35,201 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:59:35,201 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_reverse_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 06:59:35,201 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:59:35,201 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:59:35,223 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 06:59:35,228 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 06:59:35,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 06:59:35,232 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 06:59:35,233 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 06:59:35,235 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 06:59:35,237 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 06:59:35,239 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 06:59:35,240 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 06:59:35,242 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 06:59:35,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 06:59:35,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 06:59:35,247 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 06:59:35,534 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2018-11-10 06:59:35,679 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2018-11-10 06:59:35,679 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 06:59:35,681 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 06:59:35,682 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 06:59:35,683 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 06:59:35,684 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 06:59:35,685 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 06:59:35,687 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 06:59:35,688 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 06:59:35,689 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 06:59:36,097 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:59:36,100 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:59:36,101 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 06:59:36,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:36,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:36,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:36,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,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 06:59:36,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:36,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:36,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,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 06:59:36,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:36,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:36,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:36,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,120 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 06:59:36,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:36,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:36,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:36,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,125 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 06:59:36,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:36,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:36,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,131 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 06:59:36,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:36,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:36,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:36,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,135 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 06:59:36,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:36,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:36,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:36,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,138 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 06:59:36,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:36,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:36,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:36,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,140 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 06:59:36,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:36,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:36,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:36,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,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 06:59:36,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:36,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:36,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:36,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,144 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 06:59:36,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:36,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:36,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:36,146 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,146 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 06:59:36,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:36,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:36,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:36,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,148 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 06:59:36,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:36,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:36,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,162 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 06:59:36,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:36,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:36,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:36,168 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 06:59:36,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:36,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:36,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:36,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:36,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:36,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:36,216 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:59:36,239 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 06:59:36,239 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 06:59:36,242 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:59:36,243 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:59:36,244 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:59:36,244 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~src~0.offset, v_rep(select #length ULTIMATE.start_main_~nondetString~0.base)_1) = 2*ULTIMATE.start_cstrncpy_~src~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString~0.base)_1 Supporting invariants [] [2018-11-10 06:59:36,287 INFO L297 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2018-11-10 06:59:36,296 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 06:59:36,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:59:36,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:59:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:59:36,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:59:36,423 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 06:59:36,437 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 06:59:36,438 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 6 states. [2018-11-10 06:59:36,524 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 6 states. Result 43 states and 53 transitions. Complement of second has 8 states. [2018-11-10 06:59:36,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 06:59:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 06:59:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-10 06:59:36,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 06:59:36,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:59:36,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 06:59:36,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:59:36,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-10 06:59:36,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:59:36,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2018-11-10 06:59:36,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 06:59:36,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 19 states and 22 transitions. [2018-11-10 06:59:36,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 06:59:36,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 06:59:36,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-10 06:59:36,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:59:36,535 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 06:59:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-10 06:59:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 06:59:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 06:59:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-10 06:59:36,556 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 06:59:36,557 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-10 06:59:36,557 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:59:36,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-10 06:59:36,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 06:59:36,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:59:36,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:59:36,557 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:59:36,557 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:59:36,558 INFO L793 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 198#L385 assume !(main_~length~0 < 1); 199#L385-2 assume !(main_~n~0 < 1); 193#L388-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~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~malloc213.base, main_#t~malloc213.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~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~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~malloc214.base, main_#t~malloc214.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~malloc214.base, main_#t~malloc214.offset; 194#L393 SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + 0, 1); srcloc: L393 205#L393-1 main_~nondetString~0.base, main_~nondetString~0.offset := main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1) * 1;assume { :begin_inline_cstrncpy } true;cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 209#L370-3 assume true; 211#L370-1 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset - 1; 202#L372 SUMMARY for call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1); srcloc: L372 203#L372-1 SUMMARY for call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); srcloc: L372-1 208#L372-2 assume cstrncpy_#t~mem208 == 0;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 197#L375-4 [2018-11-10 06:59:36,558 INFO L795 eck$LassoCheckResult]: Loop: 197#L375-4 assume true; 200#L375-1 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 201#L375-2 assume !!(cstrncpy_#t~post209 != 0);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset - 1; 195#L376 SUMMARY for call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1); srcloc: L376 196#L376-1 havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 197#L375-4 [2018-11-10 06:59:36,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:36,558 INFO L82 PathProgramCache]: Analyzing trace with hash -795574542, now seen corresponding path program 1 times [2018-11-10 06:59:36,558 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:36,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:36,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:36,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:36,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:36,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:36,584 INFO L82 PathProgramCache]: Analyzing trace with hash 63050697, now seen corresponding path program 1 times [2018-11-10 06:59:36,584 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:36,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:36,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:36,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:36,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:36,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:36,593 INFO L82 PathProgramCache]: Analyzing trace with hash 227296120, now seen corresponding path program 1 times [2018-11-10 06:59:36,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:59:36,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:59:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:36,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:59:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:59:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:59:37,008 WARN L179 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 141 [2018-11-10 06:59:37,107 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:59:37,107 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:59:37,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:59:37,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:59:37,107 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:59:37,107 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:59:37,108 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:59:37,108 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:59:37,108 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 06:59:37,108 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:59:37,108 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:59:37,111 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 06:59:37,113 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 06:59:37,114 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 06:59:37,116 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 06:59:37,117 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 06:59:37,119 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 06:59:37,120 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 06:59:37,121 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 06:59:37,122 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 06:59:37,123 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 06:59:37,125 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 06:59:37,126 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 06:59:37,126 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 06:59:37,127 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 06:59:37,128 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 06:59:37,129 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 06:59:37,130 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 06:59:37,131 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 06:59:37,396 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 109 [2018-11-10 06:59:37,459 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 06:59:37,865 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:59:37,865 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:59:37,865 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 06:59:37,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,867 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 06:59:37,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,873 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 06:59:37,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,875 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 06:59:37,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,876 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 06:59:37,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:37,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:37,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,879 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 06:59:37,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,880 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 06:59:37,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,882 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,882 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 06:59:37,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,883 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,883 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 06:59:37,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,884 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,884 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 06:59:37,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:37,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:37,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,887 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 06:59:37,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,888 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,889 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 06:59:37,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,891 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 06:59:37,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,892 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 06:59:37,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,894 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 06:59:37,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,896 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 06:59:37,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,897 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 06:59:37,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,899 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 06:59:37,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:37,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:37,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,903 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 06:59:37,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:37,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:37,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,906 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 06:59:37,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:37,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:37,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,916 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 06:59:37,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,918 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 06:59:37,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,919 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:59:37,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,920 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:59:37,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:37,928 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,929 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 06:59:37,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:37,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:37,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,932 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 06:59:37,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:37,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:37,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,936 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 06:59:37,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:37,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:37,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,944 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 06:59:37,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:37,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:37,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,947 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 06:59:37,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:59:37,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:59:37,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,956 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 06:59:37,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:59:37,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:59:37,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:59:37,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:59:37,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:59:37,960 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 06:59:37,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:59:37,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:59:37,960 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:59:37,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:59:37,971 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 06:59:37,971 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 06:59:38,062 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:59:38,130 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 06:59:38,130 INFO L444 ModelExtractionUtils]: 69 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 06:59:38,130 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:59:38,132 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-10 06:59:38,132 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:59:38,132 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2) = 2*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2 Supporting invariants [] [2018-11-10 06:59:38,184 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2018-11-10 06:59:38,186 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 06:59:38,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:59:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:59:38,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:59:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:59:38,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:59:38,275 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 06:59:38,275 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 06:59:38,275 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-10 06:59:38,335 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 25 states and 29 transitions. Complement of second has 8 states. [2018-11-10 06:59:38,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 06:59:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 06:59:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-10 06:59:38,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 06:59:38,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:59:38,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 06:59:38,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:59:38,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 06:59:38,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:59:38,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-11-10 06:59:38,339 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:59:38,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-11-10 06:59:38,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 06:59:38,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 06:59:38,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 06:59:38,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:59:38,339 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:59:38,339 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:59:38,339 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:59:38,339 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 06:59:38,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:59:38,340 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:59:38,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 06:59:38,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 06:59:38 BoogieIcfgContainer [2018-11-10 06:59:38,344 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 06:59:38,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:59:38,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:59:38,344 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:59:38,345 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:59:34" (3/4) ... [2018-11-10 06:59:38,347 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 06:59:38,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:59:38,348 INFO L168 Benchmark]: Toolchain (without parser) took 4474.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.9 MB). Free memory was 955.3 MB in the beginning and 991.6 MB in the end (delta: -36.3 MB). Peak memory consumption was 274.6 MB. Max. memory is 11.5 GB. [2018-11-10 06:59:38,348 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:59:38,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.26 ms. Allocated memory is still 1.0 GB. Free memory was 955.3 MB in the beginning and 928.4 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-10 06:59:38,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 928.4 MB in the beginning and 1.1 GB in the end (delta: -205.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:59:38,350 INFO L168 Benchmark]: Boogie Preprocessor took 15.96 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:59:38,350 INFO L168 Benchmark]: RCFGBuilder took 200.25 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: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2018-11-10 06:59:38,350 INFO L168 Benchmark]: BuchiAutomizer took 3841.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 991.6 MB in the end (delta: 115.9 MB). Peak memory consumption was 290.0 MB. Max. memory is 11.5 GB. [2018-11-10 06:59:38,351 INFO L168 Benchmark]: Witness Printer took 2.95 ms. Allocated memory is still 1.3 GB. Free memory is still 991.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:59:38,353 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.26 ms. Allocated memory is still 1.0 GB. Free memory was 955.3 MB in the beginning and 928.4 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 86.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 928.4 MB in the beginning and 1.1 GB in the end (delta: -205.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.96 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 200.25 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: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3841.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 991.6 MB in the end (delta: 115.9 MB). Peak memory consumption was 290.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.95 ms. Allocated memory is still 1.3 GB. Free memory is still 991.6 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * src + unknown-#length-unknown[nondetString] and consists of 6 locations. One deterministic module has affine ranking function 2 * us + unknown-#length-unknown[__builtin_alloca(n * sizeof(char))] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 35 SDtfs, 46 SDslu, 45 SDs, 0 SdLazy, 24 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax100 hnf99 lsp97 ukn107 mio100 lsp32 div100 bol100 ite100 ukn100 eq202 hnf89 smp100 dnf116 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 172ms VariablesStem: 14 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...