./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6d213bb73df5e8110170d83073afe858aea401c0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 23:05:02,899 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 23:05:02,900 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 23:05:02,906 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 23:05:02,906 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 23:05:02,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 23:05:02,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 23:05:02,908 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 23:05:02,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 23:05:02,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 23:05:02,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 23:05:02,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 23:05:02,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 23:05:02,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 23:05:02,912 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 23:05:02,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 23:05:02,914 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 23:05:02,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 23:05:02,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 23:05:02,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 23:05:02,918 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 23:05:02,918 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 23:05:02,919 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 23:05:02,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 23:05:02,920 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 23:05:02,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 23:05:02,921 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 23:05:02,921 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 23:05:02,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 23:05:02,922 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 23:05:02,922 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 23:05:02,922 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 23:05:02,922 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 23:05:02,923 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 23:05:02,923 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 23:05:02,924 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 23:05:02,924 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-09 23:05:02,932 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 23:05:02,932 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 23:05:02,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 23:05:02,933 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 23:05:02,933 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 23:05:02,933 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 23:05:02,933 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 23:05:02,933 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 23:05:02,933 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 23:05:02,933 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 23:05:02,934 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 23:05:02,934 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 23:05:02,934 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 23:05:02,934 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 23:05:02,934 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 23:05:02,934 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 23:05:02,934 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 23:05:02,934 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 23:05:02,935 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 23:05:02,935 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 23:05:02,935 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 23:05:02,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 23:05:02,935 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 23:05:02,935 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 23:05:02,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 23:05:02,935 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 23:05:02,936 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 23:05:02,936 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 23:05:02,936 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_e1493c1a-1a9b-4c6a-849f-c88eb78db225/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d213bb73df5e8110170d83073afe858aea401c0 [2018-11-09 23:05:02,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 23:05:02,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 23:05:02,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 23:05:02,972 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 23:05:02,972 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 23:05:02,973 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i [2018-11-09 23:05:03,019 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/bin-2019/uautomizer/data/697bd5f17/b4bc07121399431b837f5815ed4eaa1b/FLAG17aaee8cd [2018-11-09 23:05:03,454 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 23:05:03,454 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca_true-termination.c.i [2018-11-09 23:05:03,463 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/bin-2019/uautomizer/data/697bd5f17/b4bc07121399431b837f5815ed4eaa1b/FLAG17aaee8cd [2018-11-09 23:05:03,473 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/bin-2019/uautomizer/data/697bd5f17/b4bc07121399431b837f5815ed4eaa1b [2018-11-09 23:05:03,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 23:05:03,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 23:05:03,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 23:05:03,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 23:05:03,479 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 23:05:03,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:05:03" (1/1) ... [2018-11-09 23:05:03,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c841b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03, skipping insertion in model container [2018-11-09 23:05:03,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:05:03" (1/1) ... [2018-11-09 23:05:03,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 23:05:03,514 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 23:05:03,692 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:05:03,699 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 23:05:03,727 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 23:05:03,750 INFO L193 MainTranslator]: Completed translation [2018-11-09 23:05:03,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03 WrapperNode [2018-11-09 23:05:03,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 23:05:03,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 23:05:03,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 23:05:03,751 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 23:05:03,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03" (1/1) ... [2018-11-09 23:05:03,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03" (1/1) ... [2018-11-09 23:05:03,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 23:05:03,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 23:05:03,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 23:05:03,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 23:05:03,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03" (1/1) ... [2018-11-09 23:05:03,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03" (1/1) ... [2018-11-09 23:05:03,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03" (1/1) ... [2018-11-09 23:05:03,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03" (1/1) ... [2018-11-09 23:05:03,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03" (1/1) ... [2018-11-09 23:05:03,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03" (1/1) ... [2018-11-09 23:05:03,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03" (1/1) ... [2018-11-09 23:05:03,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 23:05:03,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 23:05:03,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 23:05:03,843 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 23:05:03,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1493c1a-1a9b-4c6a-849f-c88eb78db225/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-09 23:05:03,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-09 23:05:03,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-09 23:05:03,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 23:05:03,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 23:05:04,058 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 23:05:04,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:05:04 BoogieIcfgContainer [2018-11-09 23:05:04,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 23:05:04,059 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 23:05:04,059 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 23:05:04,061 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 23:05:04,062 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:05:04,062 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 11:05:03" (1/3) ... [2018-11-09 23:05:04,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3807d75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 11:05:04, skipping insertion in model container [2018-11-09 23:05:04,063 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:05:04,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:05:03" (2/3) ... [2018-11-09 23:05:04,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3807d75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 11:05:04, skipping insertion in model container [2018-11-09 23:05:04,063 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 23:05:04,063 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:05:04" (3/3) ... [2018-11-09 23:05:04,065 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-termination.c.i [2018-11-09 23:05:04,102 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 23:05:04,103 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 23:05:04,103 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 23:05:04,103 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 23:05:04,103 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 23:05:04,103 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 23:05:04,103 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 23:05:04,103 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 23:05:04,103 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 23:05:04,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-09 23:05:04,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 23:05:04,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:05:04,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:05:04,131 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:05:04,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-09 23:05:04,131 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 23:05:04,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-09 23:05:04,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 23:05:04,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:05:04,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:05:04,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:05:04,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-09 23:05:04,139 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#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, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 15#L570true assume !(main_~length~0 < 1); 4#L570-2true assume !(main_~n~1 < 1); 26#L573-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~1 * 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_~nondetString1~0.base, main_~nondetString1~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_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 18#L578true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1) * 1, 1); srcloc: L578 19#L578-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L578-1 3#L579true assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 21#L553true assume cstrlcpy_~n~0 % 4294967296 != 0; 12#L554-4true [2018-11-09 23:05:04,139 INFO L795 eck$LassoCheckResult]: Loop: 12#L554-4true assume true; 8#L554-1true cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 9#L554-2true assume !!(cstrlcpy_#t~pre2 % 4294967296 != 0);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset + 1;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset + 1; 5#L555true SUMMARY for call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1); srcloc: L555 6#L555-1true SUMMARY for call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); srcloc: L555-1 22#L555-2true assume !(cstrlcpy_#t~mem5 == 0);havoc cstrlcpy_#t~mem5;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset;havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset; 12#L554-4true [2018-11-09 23:05:04,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1298223690, now seen corresponding path program 1 times [2018-11-09 23:05:04,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:05:04,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:05:04,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:04,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:05:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:04,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1629153641, now seen corresponding path program 1 times [2018-11-09 23:05:04,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:05:04,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:05:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:04,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:05:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:04,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:04,268 INFO L82 PathProgramCache]: Analyzing trace with hash 912105714, now seen corresponding path program 1 times [2018-11-09 23:05:04,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:05:04,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:05:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:04,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:05:04,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:04,719 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 106 [2018-11-09 23:05:04,842 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-09 23:05:04,849 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:05:04,850 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:05:04,850 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:05:04,850 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:05:04,851 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:05:04,851 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:05:04,851 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:05:04,851 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:05:04,851 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-09 23:05:04,851 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:05:04,852 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:05:04,877 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-09 23:05:04,883 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-09 23:05:05,216 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2018-11-09 23:05:05,371 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2018-11-09 23:05:05,371 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-09 23:05:05,372 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-09 23:05:05,374 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-09 23:05:05,375 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-09 23:05:05,376 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-09 23:05:05,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-09 23:05:05,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-09 23:05:05,382 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-09 23:05:05,383 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-09 23:05:05,387 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-09 23:05:05,388 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-09 23:05:05,389 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-09 23:05:05,393 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-09 23:05:05,394 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-09 23:05:05,402 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-09 23:05:05,404 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-09 23:05:05,406 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-09 23:05:05,409 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-09 23:05:05,665 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2018-11-09 23:05:06,064 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:05:06,067 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:05:06,069 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-09 23:05:06,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:06,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:06,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:06,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:06,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:06,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:06,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:06,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:06,073 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-09 23:05:06,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:06,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:06,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:06,074 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:05:06,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:06,074 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:05:06,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:06,077 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:06,077 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-09 23:05:06,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:06,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:06,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:06,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:06,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:06,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:06,099 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:06,100 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-09 23:05:06,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:06,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:06,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:06,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:06,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:06,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:06,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:06,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:05:06,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:06,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:06,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:06,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:06,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:06,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:06,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:06,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:06,109 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-09 23:05:06,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:06,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:06,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:06,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:06,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:06,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:06,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:06,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:05:06,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:06,117 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:05:06,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:06,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:06,121 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:05:06,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:06,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:06,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-09 23:05:06,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:06,138 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:05:06,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:06,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:06,142 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:05:06,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:06,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:06,155 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-09 23:05:06,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:06,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:06,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:06,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:06,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:06,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:06,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:06,160 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-09 23:05:06,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:06,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:06,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:06,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:06,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:06,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:06,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:05:06,300 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-09 23:05:06,300 INFO L444 ModelExtractionUtils]: 57 out of 67 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-09 23:05:06,302 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:05:06,303 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 23:05:06,303 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:05:06,304 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2018-11-09 23:05:06,353 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2018-11-09 23:05:06,361 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-09 23:05:06,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:05:06,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:05:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:05:06,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:05:06,528 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-09 23:05:06,541 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-09 23:05:06,542 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 7 states. [2018-11-09 23:05:06,675 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 7 states. Result 75 states and 97 transitions. Complement of second has 10 states. [2018-11-09 23:05:06,676 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-09 23:05:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-09 23:05:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-09 23:05:06,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-09 23:05:06,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:05:06,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-09 23:05:06,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:05:06,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 66 transitions. Stem has 9 letters. Loop has 12 letters. [2018-11-09 23:05:06,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:05:06,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 97 transitions. [2018-11-09 23:05:06,686 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-09 23:05:06,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 39 states and 47 transitions. [2018-11-09 23:05:06,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-09 23:05:06,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-09 23:05:06,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2018-11-09 23:05:06,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:05:06,692 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-09 23:05:06,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2018-11-09 23:05:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-11-09 23:05:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-09 23:05:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-09 23:05:06,714 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-09 23:05:06,714 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-09 23:05:06,714 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 23:05:06,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-09 23:05:06,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-09 23:05:06,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:05:06,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:05:06,716 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:05:06,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-09 23:05:06,716 INFO L793 eck$LassoCheckResult]: Stem: 273#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 263#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, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 264#L570 assume !(main_~length~0 < 1); 256#L570-2 assume !(main_~n~1 < 1); 257#L573-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~1 * 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_~nondetString1~0.base, main_~nondetString1~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_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 258#L578 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1) * 1, 1); srcloc: L578 259#L578-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L578-1 254#L579 assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 255#L553 assume !(cstrlcpy_~n~0 % 4294967296 != 0); 265#L553-1 assume cstrlcpy_~n~0 % 4294967296 == 0; 274#L560 assume !(cstrlcpy_~siz % 4294967296 != 0); 252#L562-4 [2018-11-09 23:05:06,716 INFO L795 eck$LassoCheckResult]: Loop: 252#L562-4 assume true; 253#L562 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset + 1; 275#L562-1 SUMMARY for call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); srcloc: L562-1 277#L562-2 assume !!(cstrlcpy_#t~mem7 != 0);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 252#L562-4 [2018-11-09 23:05:06,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:06,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2052473895, now seen corresponding path program 1 times [2018-11-09 23:05:06,716 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:05:06,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:05:06,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:06,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:05:06,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:06,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:06,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2711016, now seen corresponding path program 1 times [2018-11-09 23:05:06,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:05:06,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:05:06,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:06,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:05:06,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:06,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:06,743 INFO L82 PathProgramCache]: Analyzing trace with hash 534060814, now seen corresponding path program 1 times [2018-11-09 23:05:06,743 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:05:06,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:05:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:06,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:05:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:07,038 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2018-11-09 23:05:07,116 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:05:07,116 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:05:07,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:05:07,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:05:07,117 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:05:07,117 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:05:07,117 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:05:07,117 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:05:07,117 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-09 23:05:07,117 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:05:07,117 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:05:07,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-09 23:05:07,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-09 23:05:07,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-09 23:05:07,135 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-09 23:05:07,137 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-09 23:05:07,138 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-09 23:05:07,140 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-09 23:05:07,141 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-09 23:05:07,142 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-09 23:05:07,144 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-09 23:05:07,146 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-09 23:05:07,147 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-09 23:05:07,340 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2018-11-09 23:05:07,402 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-09 23:05:07,404 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-09 23:05:07,406 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-09 23:05:07,407 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-09 23:05:07,408 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-09 23:05:07,409 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-09 23:05:07,410 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-09 23:05:07,411 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-09 23:05:07,761 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:05:07,761 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:05:07,761 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-09 23:05:07,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:07,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:07,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:07,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,763 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-09 23:05:07,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:07,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:07,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:07,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,765 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-09 23:05:07,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:07,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:07,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:07,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,767 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-09 23:05:07,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:07,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:07,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,769 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-09 23:05:07,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:07,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:07,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:07,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,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-09 23:05:07,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:07,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:07,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,774 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-09 23:05:07,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:07,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:07,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:07,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,776 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-09 23:05:07,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:07,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:07,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:07,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,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-09 23:05:07,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:07,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:07,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:07,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,780 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-09 23:05:07,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:07,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:07,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,782 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-09 23:05:07,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:07,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:07,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:07,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,784 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-09 23:05:07,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:07,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:07,787 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,787 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-09 23:05:07,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:07,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:07,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,792 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-09 23:05:07,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:07,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:07,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,794 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-09 23:05:07,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:07,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:07,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,798 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-09 23:05:07,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:07,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:07,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,801 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-09 23:05:07,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:07,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:07,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,807 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-09 23:05:07,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,808 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 23:05:07,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,810 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 23:05:07,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:07,817 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:07,818 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-09 23:05:07,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:07,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:07,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:07,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:07,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:07,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:07,827 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:05:07,833 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 23:05:07,834 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-09 23:05:07,834 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:05:07,834 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 23:05:07,835 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:05:07,836 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-11-09 23:05:07,855 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-09 23:05:07,857 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-09 23:05:07,857 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-09 23:05:07,857 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-09 23:05:07,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:05:07,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:05:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:05:07,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:05:07,935 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-09 23:05:07,935 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-09 23:05:07,935 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-09 23:05:07,986 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 35 states and 43 transitions. Complement of second has 8 states. [2018-11-09 23:05:07,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:05:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-09 23:05:07,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-09 23:05:07,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-09 23:05:07,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:05:07,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-09 23:05:07,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:05:07,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-09 23:05:07,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:05:07,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2018-11-09 23:05:07,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-09 23:05:07,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 26 states and 32 transitions. [2018-11-09 23:05:07,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-09 23:05:07,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-09 23:05:07,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-09 23:05:07,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:05:07,993 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-09 23:05:07,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-09 23:05:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-09 23:05:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-09 23:05:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-11-09 23:05:07,994 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-09 23:05:07,994 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-09 23:05:07,995 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 23:05:07,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-11-09 23:05:07,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-09 23:05:07,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:05:07,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:05:07,998 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:05:07,998 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-09 23:05:07,998 INFO L793 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 440#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, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 441#L570 assume !(main_~length~0 < 1); 433#L570-2 assume !(main_~n~1 < 1); 434#L573-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~1 * 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_~nondetString1~0.base, main_~nondetString1~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_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 435#L578 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1) * 1, 1); srcloc: L578 436#L578-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L578-1 431#L579 assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 432#L553 assume !(cstrlcpy_~n~0 % 4294967296 != 0); 443#L553-1 assume cstrlcpy_~n~0 % 4294967296 == 0; 451#L560 assume cstrlcpy_~siz % 4294967296 != 0; 453#L561 SUMMARY for call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); srcloc: L561 429#L562-4 [2018-11-09 23:05:07,998 INFO L795 eck$LassoCheckResult]: Loop: 429#L562-4 assume true; 430#L562 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset + 1; 452#L562-1 SUMMARY for call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); srcloc: L562-1 454#L562-2 assume !!(cstrlcpy_#t~mem7 != 0);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 429#L562-4 [2018-11-09 23:05:07,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:07,998 INFO L82 PathProgramCache]: Analyzing trace with hash -797818736, now seen corresponding path program 1 times [2018-11-09 23:05:07,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:05:07,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:05:07,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:07,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:05:07,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:05:08,032 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-09 23:05:08,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 23:05:08,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-09 23:05:08,034 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-09 23:05:08,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:08,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2711016, now seen corresponding path program 2 times [2018-11-09 23:05:08,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:05:08,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:05:08,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:08,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:05:08,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:08,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 23:05:08,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 23:05:08,075 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-09 23:05:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 23:05:08,096 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-09 23:05:08,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-09 23:05:08,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-09 23:05:08,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-09 23:05:08,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 33 transitions. [2018-11-09 23:05:08,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-09 23:05:08,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-09 23:05:08,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2018-11-09 23:05:08,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 23:05:08,098 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-09 23:05:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2018-11-09 23:05:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-09 23:05:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-09 23:05:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-09 23:05:08,101 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-09 23:05:08,101 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-09 23:05:08,101 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-09 23:05:08,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-11-09 23:05:08,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-09 23:05:08,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 23:05:08,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 23:05:08,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 23:05:08,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-09 23:05:08,102 INFO L793 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 505#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, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 506#L570 assume !(main_~length~0 < 1); 498#L570-2 assume !(main_~n~1 < 1); 499#L573-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~1 * 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_~nondetString1~0.base, main_~nondetString1~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_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; 500#L578 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1) * 1, 1); srcloc: L578 501#L578-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L578-1 496#L579 assume { :begin_inline_cstrlcpy } true;cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 497#L553 assume cstrlcpy_~n~0 % 4294967296 != 0; 507#L554-4 assume true; 508#L554-1 cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 509#L554-2 assume !(cstrlcpy_#t~pre2 % 4294967296 != 0);havoc cstrlcpy_#t~pre2; 512#L553-1 assume cstrlcpy_~n~0 % 4294967296 == 0; 516#L560 assume cstrlcpy_~siz % 4294967296 != 0; 518#L561 SUMMARY for call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); srcloc: L561 494#L562-4 [2018-11-09 23:05:08,102 INFO L795 eck$LassoCheckResult]: Loop: 494#L562-4 assume true; 495#L562 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset + 1; 517#L562-1 SUMMARY for call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); srcloc: L562-1 519#L562-2 assume !!(cstrlcpy_#t~mem7 != 0);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 494#L562-4 [2018-11-09 23:05:08,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:08,102 INFO L82 PathProgramCache]: Analyzing trace with hash 912061087, now seen corresponding path program 1 times [2018-11-09 23:05:08,102 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:05:08,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:05:08,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:08,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:05:08,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:08,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:08,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2711016, now seen corresponding path program 3 times [2018-11-09 23:05:08,117 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:05:08,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:05:08,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:08,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 23:05:08,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:08,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash 57659782, now seen corresponding path program 1 times [2018-11-09 23:05:08,121 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 23:05:08,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 23:05:08,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:08,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 23:05:08,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 23:05:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 23:05:08,517 WARN L179 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 119 [2018-11-09 23:05:08,644 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-09 23:05:08,645 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 23:05:08,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 23:05:08,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 23:05:08,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 23:05:08,646 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 23:05:08,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 23:05:08,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 23:05:08,646 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 23:05:08,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-09 23:05:08,646 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 23:05:08,646 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 23:05:08,648 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-09 23:05:08,650 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-09 23:05:08,652 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-09 23:05:08,653 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-09 23:05:08,655 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-09 23:05:08,657 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-09 23:05:08,944 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2018-11-09 23:05:09,012 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-09 23:05:09,013 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-09 23:05:09,014 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-09 23:05:09,015 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-09 23:05:09,016 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-09 23:05:09,024 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-09 23:05:09,027 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-09 23:05:09,028 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-09 23:05:09,029 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-09 23:05:09,030 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-09 23:05:09,031 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-09 23:05:09,031 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-09 23:05:09,032 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-09 23:05:09,033 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-09 23:05:09,035 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-09 23:05:09,216 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2018-11-09 23:05:09,478 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 23:05:09,478 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 23:05:09,479 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-09 23:05:09,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:09,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:09,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:09,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:09,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:09,481 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-09 23:05:09,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:09,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:09,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:09,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:09,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-09 23:05:09,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:09,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:09,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:09,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:09,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:09,485 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-09 23:05:09,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:09,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:09,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:09,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:09,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:09,487 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-09 23:05:09,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:09,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:09,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:09,495 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:09,496 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-09 23:05:09,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:09,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:09,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 23:05:09,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:09,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:09,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-09 23:05:09,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:09,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:09,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:09,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:09,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-09 23:05:09,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:09,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:09,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:09,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:09,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-09 23:05:09,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:09,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:09,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:09,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:09,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-09 23:05:09,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:09,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:09,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:09,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:09,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-09 23:05:09,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 23:05:09,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,515 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 23:05:09,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,515 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 23:05:09,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 23:05:09,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:09,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-09 23:05:09,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:09,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:09,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:09,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 23:05:09,521 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-09 23:05:09,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 23:05:09,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 23:05:09,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 23:05:09,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 23:05:09,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 23:05:09,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 23:05:09,538 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 23:05:09,549 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 23:05:09,549 INFO L444 ModelExtractionUtils]: 59 out of 64 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-09 23:05:09,549 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 23:05:09,550 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 23:05:09,550 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 23:05:09,550 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrlcpy_~s~0.offset Supporting invariants [] [2018-11-09 23:05:09,581 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-09 23:05:09,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-09 23:05:09,584 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-09 23:05:09,584 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-09 23:05:09,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 23:05:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:05:09,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:05:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 23:05:09,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 23:05:09,655 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-09 23:05:09,656 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-09 23:05:09,656 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-09 23:05:09,697 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 31 states and 37 transitions. Complement of second has 8 states. [2018-11-09 23:05:09,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 23:05:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-09 23:05:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-09 23:05:09,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-09 23:05:09,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:05:09,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-09 23:05:09,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:05:09,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-09 23:05:09,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 23:05:09,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2018-11-09 23:05:09,700 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 23:05:09,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2018-11-09 23:05:09,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 23:05:09,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 23:05:09,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 23:05:09,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 23:05:09,700 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:05:09,700 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:05:09,700 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 23:05:09,700 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-09 23:05:09,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-09 23:05:09,701 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 23:05:09,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-09 23:05:09,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 11:05:09 BoogieIcfgContainer [2018-11-09 23:05:09,706 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 23:05:09,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 23:05:09,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 23:05:09,706 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 23:05:09,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:05:04" (3/4) ... [2018-11-09 23:05:09,709 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-09 23:05:09,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 23:05:09,710 INFO L168 Benchmark]: Toolchain (without parser) took 6234.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 957.6 MB in the beginning and 898.8 MB in the end (delta: 58.8 MB). Peak memory consumption was 284.8 MB. Max. memory is 11.5 GB. [2018-11-09 23:05:09,710 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:05:09,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.99 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-09 23:05:09,711 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-09 23:05:09,711 INFO L168 Benchmark]: Boogie Preprocessor took 19.34 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-09 23:05:09,712 INFO L168 Benchmark]: RCFGBuilder took 216.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-09 23:05:09,712 INFO L168 Benchmark]: BuchiAutomizer took 5646.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.7 MB). Free memory was 1.1 GB in the beginning and 898.8 MB in the end (delta: 209.2 MB). Peak memory consumption was 298.8 MB. Max. memory is 11.5 GB. [2018-11-09 23:05:09,712 INFO L168 Benchmark]: Witness Printer took 3.58 ms. Allocated memory is still 1.3 GB. Free memory is still 898.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 23:05:09,716 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 273.99 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.34 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 216.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5646.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.7 MB). Free memory was 1.1 GB in the beginning and 898.8 MB in the end (delta: 209.2 MB). Peak memory consumption was 298.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.58 ms. Allocated memory is still 1.3 GB. Free memory is still 898.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] + -1 * s and consists of 7 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 131 SDslu, 109 SDs, 0 SdLazy, 69 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital243 mio100 ax107 hnf99 lsp90 ukn97 mio100 lsp40 div152 bol100 ite100 ukn100 eq178 hnf70 smp94 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 6 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...