./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/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 32bit --witnessprinter.graph.data.programhash bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:50:51,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:50:51,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:50:51,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:50:51,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:50:51,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:50:51,084 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:50:51,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:50:51,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:50:51,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:50:51,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:50:51,089 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:50:51,090 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:50:51,091 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:50:51,092 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:50:51,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:50:51,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:50:51,095 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:50:51,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:50:51,098 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:50:51,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:50:51,100 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:50:51,102 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:50:51,102 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:50:51,102 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:50:51,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:50:51,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:50:51,105 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:50:51,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:50:51,106 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:50:51,106 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:50:51,107 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:50:51,107 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:50:51,107 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:50:51,108 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:50:51,109 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:50:51,109 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 11:50:51,123 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:50:51,123 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:50:51,124 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:50:51,124 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:50:51,124 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:50:51,125 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:50:51,125 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:50:51,125 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:50:51,125 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:50:51,125 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:50:51,126 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:50:51,126 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:50:51,126 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:50:51,126 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:50:51,126 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:50:51,127 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:50:51,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:50:51,127 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:50:51,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:50:51,127 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:50:51,128 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:50:51,128 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:50:51,128 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:50:51,128 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:50:51,128 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:50:51,129 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:50:51,129 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:50:51,129 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:50:51,129 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:50:51,129 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:50:51,130 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:50:51,130 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_d56d5f19-1066-4622-964e-f34ebc127695/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb65be693a5a8084c5f6f02ff3a6e18ec8f053b3 [2018-11-10 11:50:51,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:50:51,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:50:51,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:50:51,177 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:50:51,177 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:50:51,178 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-10 11:50:51,232 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/bin-2019/uautomizer/data/aa044a7eb/a23cc966c3f34f9094fd17d3870a4895/FLAG671cac035 [2018-11-10 11:50:51,612 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:50:51,613 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-10 11:50:51,621 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/bin-2019/uautomizer/data/aa044a7eb/a23cc966c3f34f9094fd17d3870a4895/FLAG671cac035 [2018-11-10 11:50:51,631 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/bin-2019/uautomizer/data/aa044a7eb/a23cc966c3f34f9094fd17d3870a4895 [2018-11-10 11:50:51,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:50:51,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:50:51,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:50:51,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:50:51,638 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:50:51,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:50:51" (1/1) ... [2018-11-10 11:50:51,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c80a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51, skipping insertion in model container [2018-11-10 11:50:51,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:50:51" (1/1) ... [2018-11-10 11:50:51,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:50:51,687 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:50:51,921 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:50:51,928 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:50:51,963 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:50:51,992 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:50:51,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51 WrapperNode [2018-11-10 11:50:51,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:50:51,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:50:51,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:50:51,994 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:50:52,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51" (1/1) ... [2018-11-10 11:50:52,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51" (1/1) ... [2018-11-10 11:50:52,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:50:52,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:50:52,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:50:52,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:50:52,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51" (1/1) ... [2018-11-10 11:50:52,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51" (1/1) ... [2018-11-10 11:50:52,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51" (1/1) ... [2018-11-10 11:50:52,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51" (1/1) ... [2018-11-10 11:50:52,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51" (1/1) ... [2018-11-10 11:50:52,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51" (1/1) ... [2018-11-10 11:50:52,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51" (1/1) ... [2018-11-10 11:50:52,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:50:52,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:50:52,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:50:52,095 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:50:52,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d56d5f19-1066-4622-964e-f34ebc127695/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:50:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:50:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:50:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:50:52,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:50:52,402 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:50:52,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:52 BoogieIcfgContainer [2018-11-10 11:50:52,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:50:52,403 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:50:52,403 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:50:52,407 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:50:52,408 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:50:52,408 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:50:51" (1/3) ... [2018-11-10 11:50:52,409 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e3b160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:50:52, skipping insertion in model container [2018-11-10 11:50:52,409 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:50:52,410 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:50:51" (2/3) ... [2018-11-10 11:50:52,410 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e3b160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:50:52, skipping insertion in model container [2018-11-10 11:50:52,410 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:50:52,410 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:52" (3/3) ... [2018-11-10 11:50:52,412 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-11-10 11:50:52,469 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:50:52,469 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:50:52,470 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:50:52,470 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:50:52,470 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:50:52,470 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:50:52,470 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:50:52,470 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:50:52,470 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:50:52,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 11:50:52,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 11:50:52,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:50:52,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:50:52,509 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:52,509 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 11:50:52,509 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:50:52,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-10 11:50:52,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 11:50:52,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:50:52,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:50:52,512 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:52,512 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 11:50:52,519 INFO L793 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 18#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.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~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 26#L559true assume !(main_~length~0 < 1); 7#L559-2true assume !(main_~n~0 < 1); 23#L562-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~malloc10.base, main_#t~malloc10.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~malloc10.base, main_#t~malloc10.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~malloc11.base, main_#t~malloc11.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~malloc11.base, main_#t~malloc11.offset; 10#L567true SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L567 13#L567-1true assume { :begin_inline_cstrncpy } true;cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.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~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 17#L543true assume cstrncpy_~n % 4294967296 != 0;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 19#L546-4true [2018-11-10 11:50:52,519 INFO L795 eck$LassoCheckResult]: Loop: 19#L546-4true assume true;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset + 1;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset + 1; 5#L547true SUMMARY for call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1); srcloc: L547 8#L547-1true SUMMARY for call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); srcloc: L547-1 11#L547-2true assume !(cstrncpy_#t~mem5 == 0);havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset; 12#L546-1true cstrncpy_#t~pre2 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 15#L546-2true assume !!(cstrncpy_#t~pre2 % 4294967296 != 0);havoc cstrncpy_#t~pre2; 19#L546-4true [2018-11-10 11:50:52,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:52,525 INFO L82 PathProgramCache]: Analyzing trace with hash 180425517, now seen corresponding path program 1 times [2018-11-10 11:50:52,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:52,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:52,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:52,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:52,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:52,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:52,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1598512636, now seen corresponding path program 1 times [2018-11-10 11:50:52,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:52,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:52,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:52,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:52,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:52,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:52,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1019191256, now seen corresponding path program 1 times [2018-11-10 11:50:52,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:52,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:52,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:53,173 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2018-11-10 11:50:53,283 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-11-10 11:50:53,294 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:50:53,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:50:53,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:50:53,295 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:50:53,295 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:50:53,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:50:53,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:50:53,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:50:53,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2018-11-10 11:50:53,297 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:50:53,297 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:50:53,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,724 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2018-11-10 11:50:53,901 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2018-11-10 11:50:53,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:53,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:54,212 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2018-11-10 11:50:54,705 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:50:54,710 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:50:54,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,724 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:54,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:54,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:54,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:54,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:54,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:54,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:54,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:54,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:54,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:54,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:54,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:54,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:54,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:54,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:54,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:54,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:54,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:54,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:54,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:54,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:54,922 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:50:54,997 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 11:50:54,997 INFO L444 ModelExtractionUtils]: 59 out of 67 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 11:50:54,999 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:50:55,001 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:50:55,001 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:50:55,002 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 Supporting invariants [] [2018-11-10 11:50:55,085 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-10 11:50:55,093 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 11:50:55,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:55,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:50:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:55,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:50:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:50:55,301 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 11:50:55,302 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 6 states. [2018-11-10 11:50:55,425 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 6 states. Result 49 states and 58 transitions. Complement of second has 10 states. [2018-11-10 11:50:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:50:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 11:50:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-10 11:50:55,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-10 11:50:55,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:50:55,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-10 11:50:55,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:50:55,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 8 letters. Loop has 12 letters. [2018-11-10 11:50:55,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:50:55,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2018-11-10 11:50:55,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 11:50:55,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 21 states and 24 transitions. [2018-11-10 11:50:55,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 11:50:55,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 11:50:55,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 24 transitions. [2018-11-10 11:50:55,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:50:55,440 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-10 11:50:55,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 24 transitions. [2018-11-10 11:50:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-10 11:50:55,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 11:50:55,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-10 11:50:55,461 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-10 11:50:55,461 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-10 11:50:55,461 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:50:55,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-10 11:50:55,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 11:50:55,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:50:55,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:50:55,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:55,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:50:55,463 INFO L793 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.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~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 226#L559 assume !(main_~length~0 < 1); 214#L559-2 assume !(main_~n~0 < 1); 215#L562-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~malloc10.base, main_#t~malloc10.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~malloc10.base, main_#t~malloc10.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~malloc11.base, main_#t~malloc11.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~malloc11.base, main_#t~malloc11.offset; 218#L567 SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L567 219#L567-1 assume { :begin_inline_cstrncpy } true;cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.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~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 222#L543 assume cstrncpy_~n % 4294967296 != 0;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 224#L546-4 assume true;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset + 1;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset + 1; 210#L547 SUMMARY for call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1); srcloc: L547 211#L547-1 SUMMARY for call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); srcloc: L547-1 216#L547-2 assume cstrncpy_#t~mem5 == 0;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset; 209#L548-4 [2018-11-10 11:50:55,464 INFO L795 eck$LassoCheckResult]: Loop: 209#L548-4 assume true; 212#L548-1 cstrncpy_#t~pre6 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 213#L548-2 assume !!(cstrncpy_#t~pre6 % 4294967296 != 0);havoc cstrncpy_#t~pre6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset + 1; 217#L549 SUMMARY for call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1); srcloc: L549 208#L549-1 havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 209#L548-4 [2018-11-10 11:50:55,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:55,464 INFO L82 PathProgramCache]: Analyzing trace with hash -796590415, now seen corresponding path program 1 times [2018-11-10 11:50:55,464 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:55,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:55,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:55,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:55,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:55,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:55,492 INFO L82 PathProgramCache]: Analyzing trace with hash 60187782, now seen corresponding path program 1 times [2018-11-10 11:50:55,492 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:55,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:55,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:55,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:55,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:55,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:55,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2133519402, now seen corresponding path program 1 times [2018-11-10 11:50:55,502 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:50:55,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:50:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:55,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:50:55,967 WARN L179 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 128 [2018-11-10 11:50:56,098 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-10 11:50:56,100 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:50:56,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:50:56,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:50:56,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:50:56,101 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:50:56,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:50:56,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:50:56,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:50:56,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 11:50:56,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:50:56,101 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:50:56,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:56,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:56,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:56,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:56,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 11:50:56,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:56,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 11:50:56,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:56,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 11:50:56,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 11:50:56,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 11:50:56,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 11:50:56,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 11:50:56,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 11:50:56,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 11:50:56,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 11:50:56,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:56,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:56,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:50:56,547 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2018-11-10 11:50:56,662 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-11-10 11:50:57,017 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-11-10 11:50:57,147 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-11-10 11:50:57,479 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:50:57,480 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:50:57,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:57,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:57,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,495 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:57,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:57,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:50:57,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:50:57,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:50:57,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:57,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:57,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:57,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:57,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:57,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:57,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:50:57,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:50:57,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:50:57,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:50:57,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:50:57,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:50:57,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:50:57,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:50:57,598 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:50:57,635 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 11:50:57,635 INFO L444 ModelExtractionUtils]: 67 out of 73 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 11:50:57,636 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:50:57,637 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:50:57,638 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:50:57,638 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_cstrncpy_~dst.base)_1) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrncpy_~dst.base)_1 Supporting invariants [] [2018-11-10 11:50:57,704 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-11-10 11:50:57,706 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 11:50:57,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:57,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:50:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:57,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:50:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:50:57,790 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 11:50:57,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-10 11:50:57,832 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 26 states and 30 transitions. Complement of second has 7 states. [2018-11-10 11:50:57,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:50:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 11:50:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-10 11:50:57,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 11:50:57,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:50:57,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 11:50:57,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:50:57,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 11:50:57,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:50:57,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-11-10 11:50:57,837 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:50:57,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-11-10 11:50:57,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:50:57,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:50:57,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:50:57,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:50:57,838 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:50:57,838 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:50:57,838 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:50:57,838 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:50:57,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:50:57,839 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:50:57,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:50:57,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:50:57 BoogieIcfgContainer [2018-11-10 11:50:57,845 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:50:57,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:50:57,846 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:50:57,846 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:50:57,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:50:52" (3/4) ... [2018-11-10 11:50:57,850 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:50:57,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:50:57,851 INFO L168 Benchmark]: Toolchain (without parser) took 6216.78 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 952.2 MB in the beginning and 863.1 MB in the end (delta: 89.0 MB). Peak memory consumption was 413.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:57,852 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:50:57,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.89 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 929.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:57,856 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -210.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:57,857 INFO L168 Benchmark]: Boogie Preprocessor took 18.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:50:57,857 INFO L168 Benchmark]: RCFGBuilder took 307.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:57,857 INFO L168 Benchmark]: BuchiAutomizer took 5442.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 863.1 MB in the end (delta: 253.9 MB). Peak memory consumption was 432.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:50:57,858 INFO L168 Benchmark]: Witness Printer took 4.84 ms. Allocated memory is still 1.4 GB. Free memory is still 863.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:50:57,862 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.89 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 929.6 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -210.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 307.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5442.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 863.1 MB in the end (delta: 253.9 MB). Peak memory consumption was 432.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.84 ms. Allocated memory is still 1.4 GB. Free memory is still 863.1 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 -1 * d + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 7 locations. One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[dst] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 40 SDtfs, 51 SDslu, 46 SDs, 0 SdLazy, 32 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital251 mio100 ax100 hnf99 lsp97 ukn105 mio100 lsp52 div159 bol100 ite100 ukn100 eq178 hnf71 smp92 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...