./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strcat_short_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strcat_short_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/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 2cfe214f4978682dac68f5565e20ebc7c152d196 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:54:00,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:54:00,236 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:54:00,243 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:54:00,243 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:54:00,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:54:00,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:54:00,246 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:54:00,247 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:54:00,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:54:00,248 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:54:00,248 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:54:00,249 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:54:00,250 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:54:00,251 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:54:00,251 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:54:00,252 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:54:00,253 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:54:00,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:54:00,255 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:54:00,256 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:54:00,257 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:54:00,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:54:00,259 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:54:00,259 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:54:00,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:54:00,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:54:00,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:54:00,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:54:00,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:54:00,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:54:00,262 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:54:00,263 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:54:00,263 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:54:00,263 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:54:00,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:54:00,264 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 05:54:00,275 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:54:00,275 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:54:00,276 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:54:00,276 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:54:00,276 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:54:00,276 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 05:54:00,277 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 05:54:00,277 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 05:54:00,277 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 05:54:00,277 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 05:54:00,277 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 05:54:00,277 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:54:00,277 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:54:00,278 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:54:00,278 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:54:00,278 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 05:54:00,278 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 05:54:00,278 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 05:54:00,278 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:54:00,278 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 05:54:00,278 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:54:00,279 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 05:54:00,279 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:54:00,279 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:54:00,279 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 05:54:00,279 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:54:00,279 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:54:00,279 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 05:54:00,280 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 05:54:00,280 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_94d3dd7e-99b6-4ebc-9564-0863d70934f1/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 -> 2cfe214f4978682dac68f5565e20ebc7c152d196 [2018-11-23 05:54:00,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:54:00,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:54:00,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:54:00,314 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:54:00,314 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:54:00,314 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strcat_short_true-termination.c.i [2018-11-23 05:54:00,350 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/bin-2019/uautomizer/data/e67c0db14/babc7a7640d347f98b869eef17fd72f3/FLAGd58497331 [2018-11-23 05:54:00,772 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:54:00,772 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/sv-benchmarks/c/termination-libowfat/strcat_short_true-termination.c.i [2018-11-23 05:54:00,778 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/bin-2019/uautomizer/data/e67c0db14/babc7a7640d347f98b869eef17fd72f3/FLAGd58497331 [2018-11-23 05:54:00,786 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/bin-2019/uautomizer/data/e67c0db14/babc7a7640d347f98b869eef17fd72f3 [2018-11-23 05:54:00,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:54:00,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:54:00,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:54:00,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:54:00,791 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:54:00,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:54:00" (1/1) ... [2018-11-23 05:54:00,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed7d6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:00, skipping insertion in model container [2018-11-23 05:54:00,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:54:00" (1/1) ... [2018-11-23 05:54:00,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:54:00,825 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:54:01,008 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:54:01,015 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:54:01,081 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:54:01,109 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:54:01,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:01 WrapperNode [2018-11-23 05:54:01,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:54:01,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:54:01,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:54:01,111 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:54:01,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:01" (1/1) ... [2018-11-23 05:54:01,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:01" (1/1) ... [2018-11-23 05:54:01,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:54:01,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:54:01,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:54:01,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:54:01,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:01" (1/1) ... [2018-11-23 05:54:01,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:01" (1/1) ... [2018-11-23 05:54:01,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:01" (1/1) ... [2018-11-23 05:54:01,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:01" (1/1) ... [2018-11-23 05:54:01,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:01" (1/1) ... [2018-11-23 05:54:01,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:01" (1/1) ... [2018-11-23 05:54:01,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:01" (1/1) ... [2018-11-23 05:54:01,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:54:01,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:54:01,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:54:01,159 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:54:01,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94d3dd7e-99b6-4ebc-9564-0863d70934f1/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-23 05:54:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:54:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:54:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:54:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:54:01,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:54:01,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:54:01,339 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:54:01,340 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 05:54:01,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:54:01 BoogieIcfgContainer [2018-11-23 05:54:01,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:54:01,341 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 05:54:01,341 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 05:54:01,343 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 05:54:01,344 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:54:01,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 05:54:00" (1/3) ... [2018-11-23 05:54:01,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20cd70d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:54:01, skipping insertion in model container [2018-11-23 05:54:01,345 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:54:01,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:54:01" (2/3) ... [2018-11-23 05:54:01,346 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20cd70d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:54:01, skipping insertion in model container [2018-11-23 05:54:01,346 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:54:01,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:54:01" (3/3) ... [2018-11-23 05:54:01,347 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcat_short_true-termination.c.i [2018-11-23 05:54:01,378 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:54:01,379 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 05:54:01,379 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 05:54:01,379 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 05:54:01,379 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:54:01,379 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:54:01,379 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 05:54:01,379 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:54:01,379 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 05:54:01,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 05:54:01,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 05:54:01,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:54:01,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:54:01,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 05:54:01,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:54:01,410 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 05:54:01,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 05:54:01,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 05:54:01,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:54:01,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:54:01,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 05:54:01,412 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:54:01,419 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 7#L523true assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 20#L527true assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 16#L529true assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 14#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3#L509-4true [2018-11-23 05:54:01,419 INFO L796 eck$LassoCheckResult]: Loop: 3#L509-4true call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 15#L509-1true assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 19#L509-3true strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3#L509-4true [2018-11-23 05:54:01,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:54:01,423 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-11-23 05:54:01,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:54:01,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:54:01,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:01,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:54:01,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:01,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:54:01,512 INFO L82 PathProgramCache]: Analyzing trace with hash 55771, now seen corresponding path program 1 times [2018-11-23 05:54:01,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:54:01,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:54:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:01,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:54:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:01,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:54:01,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629391, now seen corresponding path program 1 times [2018-11-23 05:54:01,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:54:01,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:54:01,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:01,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:54:01,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:01,865 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-11-23 05:54:01,970 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-23 05:54:01,978 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:54:01,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:54:01,979 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:54:01,979 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:54:01,979 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:54:01,979 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:54:01,980 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:54:01,980 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:54:01,980 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_short_true-termination.c.i_Iteration1_Lasso [2018-11-23 05:54:01,980 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:54:01,981 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:54:01,999 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-23 05:54:02,002 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-23 05:54:02,004 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-23 05:54:02,006 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-23 05:54:02,010 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-23 05:54:02,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-23 05:54:02,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-23 05:54:02,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-23 05:54:02,019 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-23 05:54:02,025 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-23 05:54:02,026 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-23 05:54:02,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-23 05:54:02,256 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-23 05:54:02,286 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-23 05:54:02,288 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-23 05:54:02,289 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-23 05:54:02,290 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-23 05:54:02,291 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-23 05:54:02,292 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-23 05:54:02,293 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-23 05:54:02,295 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-23 05:54:02,296 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-23 05:54:02,305 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-23 05:54:02,308 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-23 05:54:02,630 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:54:02,634 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:54:02,636 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-23 05:54:02,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:02,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:02,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:02,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,642 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-23 05:54:02,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:02,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:02,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:02,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,645 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-23 05:54:02,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:02,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:02,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:02,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,647 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-23 05:54:02,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:02,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:02,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,654 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-23 05:54:02,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:02,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:02,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:02,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,657 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-23 05:54:02,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:02,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:02,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:02,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,659 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-23 05:54:02,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:02,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:02,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:02,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,662 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-23 05:54:02,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:02,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:02,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,675 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-23 05:54:02,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:02,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:02,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:02,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,677 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-23 05:54:02,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:02,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:02,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:02,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,680 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-23 05:54:02,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:02,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:02,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,685 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-23 05:54:02,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:02,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:02,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,690 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-23 05:54:02,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:02,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:02,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,694 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-23 05:54:02,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:02,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:02,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,699 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-23 05:54:02,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,700 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:54:02,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,703 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:54:02,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:02,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,723 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-23 05:54:02,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:02,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:02,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,729 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-23 05:54:02,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:02,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,730 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 05:54:02,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,731 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 05:54:02,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:02,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,733 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-23 05:54:02,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,734 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:54:02,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,736 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:54:02,736 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:02,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:02,759 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-23 05:54:02,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:02,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:02,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:02,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:02,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:02,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:02,797 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:54:02,816 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 05:54:02,816 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 05:54:02,817 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:54:02,818 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:54:02,819 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:54:02,819 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 Supporting invariants [] [2018-11-23 05:54:02,850 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 05:54:02,855 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:54:02,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:54:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:54:02,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:54:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:54:02,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:54:02,943 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-23 05:54:02,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 05:54:02,953 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 5 states. [2018-11-23 05:54:03,029 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 5 states. Result 45 states and 60 transitions. Complement of second has 8 states. [2018-11-23 05:54:03,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:54:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 05:54:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2018-11-23 05:54:03,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 05:54:03,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:54:03,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 05:54:03,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:54:03,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 44 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-23 05:54:03,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:54:03,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2018-11-23 05:54:03,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 05:54:03,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 18 states and 21 transitions. [2018-11-23 05:54:03,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 05:54:03,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 05:54:03,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-23 05:54:03,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:54:03,041 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 05:54:03,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-23 05:54:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-23 05:54:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 05:54:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-23 05:54:03,059 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-23 05:54:03,059 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-23 05:54:03,059 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 05:54:03,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-23 05:54:03,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:54:03,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:54:03,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:54:03,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:54:03,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:54:03,061 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 170#L523 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 171#L527 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 176#L529 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 175#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 167#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 168#L516-2 [2018-11-23 05:54:03,061 INFO L796 eck$LassoCheckResult]: Loop: 168#L516-2 assume !false;call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); 169#L517 assume !(0 == strcat_#t~mem6);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset; 168#L516-2 [2018-11-23 05:54:03,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:54:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907772, now seen corresponding path program 1 times [2018-11-23 05:54:03,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:54:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:54:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:03,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:54:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:54:03,107 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-23 05:54:03,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:54:03,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:54:03,109 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:54:03,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:54:03,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2470, now seen corresponding path program 1 times [2018-11-23 05:54:03,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:54:03,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:54:03,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:03,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:54:03,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:54:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:54:03,166 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-23 05:54:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:54:03,180 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 05:54:03,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:54:03,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-23 05:54:03,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:54:03,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2018-11-23 05:54:03,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 05:54:03,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 05:54:03,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-11-23 05:54:03,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:54:03,183 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 05:54:03,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-11-23 05:54:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 05:54:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 05:54:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-23 05:54:03,184 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 05:54:03,184 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 05:54:03,184 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 05:54:03,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-11-23 05:54:03,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:54:03,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:54:03,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:54:03,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:54:03,185 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:54:03,185 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 211#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out_end~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet9;havoc main_#t~nondet9; 209#L523 assume !(main_~in_len~0 < 1);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet11;havoc main_#t~nondet11; 210#L527 assume !(main_~out_len~0 < 1);main_~out_end~0 := main_#t~nondet12;havoc main_#t~nondet12; 215#L529 assume !(main_~out_len~0 < main_~out_end~0 + main_~in_len~0);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + main_~out_end~0, 1);strcat_#in~s.base, strcat_#in~s.offset, strcat_#in~t.base, strcat_#in~t.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcat_#res.base, strcat_#res.offset;havoc strcat_#t~ret5, strcat_#t~mem6, strcat_#t~pre7.base, strcat_#t~pre7.offset, strcat_#t~pre8.base, strcat_#t~pre8.offset, strcat_~s.base, strcat_~s.offset, strcat_~t.base, strcat_~t.offset, strcat_~dest~0.base, strcat_~dest~0.offset;strcat_~s.base, strcat_~s.offset := strcat_#in~s.base, strcat_#in~s.offset;strcat_~t.base, strcat_~t.offset := strcat_#in~t.base, strcat_#in~t.offset;strcat_~dest~0.base, strcat_~dest~0.offset := strcat_~s.base, strcat_~s.offset;strlen_#in~s.base, strlen_#in~s.offset := strcat_~s.base, strcat_~s.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 214#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 201#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 202#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 205#L509-5 strlen_#res := strlen_~i~0; 206#L510 strcat_#t~ret5 := strlen_#res;strcat_~s.base, strcat_~s.offset := strcat_~s.base, strcat_~s.offset + strcat_#t~ret5 % 4294967296;havoc strcat_#t~ret5; 207#L516-2 [2018-11-23 05:54:03,185 INFO L796 eck$LassoCheckResult]: Loop: 207#L516-2 assume !false;call strcat_#t~mem6 := read~int(strcat_~t.base, strcat_~t.offset, 1);call write~int(strcat_#t~mem6, strcat_~s.base, strcat_~s.offset, 1); 208#L517 assume !(0 == strcat_#t~mem6);havoc strcat_#t~mem6;strcat_#t~pre7.base, strcat_#t~pre7.offset := strcat_~s.base, 1 + strcat_~s.offset;strcat_~s.base, strcat_~s.offset := strcat_~s.base, 1 + strcat_~s.offset;havoc strcat_#t~pre7.base, strcat_#t~pre7.offset;strcat_#t~pre8.base, strcat_#t~pre8.offset := strcat_~t.base, 1 + strcat_~t.offset;strcat_~t.base, strcat_~t.offset := strcat_~t.base, 1 + strcat_~t.offset;havoc strcat_#t~pre8.base, strcat_#t~pre8.offset; 207#L516-2 [2018-11-23 05:54:03,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:54:03,186 INFO L82 PathProgramCache]: Analyzing trace with hash 765803698, now seen corresponding path program 1 times [2018-11-23 05:54:03,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:54:03,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:54:03,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:03,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:54:03,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:03,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:54:03,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2470, now seen corresponding path program 2 times [2018-11-23 05:54:03,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:54:03,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:54:03,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:03,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:54:03,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:03,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:54:03,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1497947671, now seen corresponding path program 1 times [2018-11-23 05:54:03,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:54:03,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:54:03,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:03,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:54:03,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:54:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:54:03,549 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 117 [2018-11-23 05:54:03,663 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-23 05:54:03,665 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:54:03,665 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:54:03,665 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:54:03,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:54:03,665 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:54:03,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:54:03,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:54:03,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:54:03,665 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcat_short_true-termination.c.i_Iteration3_Lasso [2018-11-23 05:54:03,665 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:54:03,665 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:54:03,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:54:03,672 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-23 05:54:03,673 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-23 05:54:03,674 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-23 05:54:03,676 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-23 05:54:03,677 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-23 05:54:03,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:54:03,680 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-23 05:54:03,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:54:03,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:54:03,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:54:03,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:54:03,686 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-23 05:54:03,911 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2018-11-23 05:54:03,979 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-23 05:54:03,981 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-23 05:54:03,982 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-23 05:54:03,982 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-23 05:54:03,983 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-23 05:54:03,984 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-23 05:54:03,986 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-23 05:54:03,987 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-23 05:54:04,322 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:54:04,323 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:54:04,323 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-23 05:54:04,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:04,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:04,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:04,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,326 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-23 05:54:04,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:04,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:04,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:04,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,327 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-23 05:54:04,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:04,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:04,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:04,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,328 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-23 05:54:04,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:04,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:04,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:04,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,330 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-23 05:54:04,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:04,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:04,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:04,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,331 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-23 05:54:04,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:04,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:04,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,344 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-23 05:54:04,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:04,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:04,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:04,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,346 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-23 05:54:04,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:04,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:04,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:04,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,348 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-23 05:54:04,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:04,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:04,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:04,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,350 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-23 05:54:04,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:04,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:04,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:04,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,352 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-23 05:54:04,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:54:04,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:54:04,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:54:04,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,357 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-23 05:54:04,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:04,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:04,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,359 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-23 05:54:04,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:04,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:04,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,366 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-23 05:54:04,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:04,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:04,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:54:04,374 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-23 05:54:04,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:54:04,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:54:04,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:54:04,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:54:04,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:54:04,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:54:04,400 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:54:04,427 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 05:54:04,427 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 05:54:04,428 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:54:04,429 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:54:04,429 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:54:04,429 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcat_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2) = -1*ULTIMATE.start_strcat_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 Supporting invariants [] [2018-11-23 05:54:04,519 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-11-23 05:54:04,521 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:54:04,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:54:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:54:04,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:54:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:54:04,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:54:04,588 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-23 05:54:04,588 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 05:54:04,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-23 05:54:04,653 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 17 states and 20 transitions. Complement of second has 6 states. [2018-11-23 05:54:04,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:54:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 05:54:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-23 05:54:04,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-23 05:54:04,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:54:04,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 05:54:04,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:54:04,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 05:54:04,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:54:04,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-11-23 05:54:04,655 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:54:04,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2018-11-23 05:54:04,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 05:54:04,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 05:54:04,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 05:54:04,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:54:04,656 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:54:04,656 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:54:04,656 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:54:04,656 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 05:54:04,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:54:04,656 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:54:04,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 05:54:04,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 05:54:04 BoogieIcfgContainer [2018-11-23 05:54:04,662 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 05:54:04,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:54:04,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:54:04,662 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:54:04,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:54:01" (3/4) ... [2018-11-23 05:54:04,666 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:54:04,666 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:54:04,667 INFO L168 Benchmark]: Toolchain (without parser) took 3878.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -279.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:54:04,668 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:54:04,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:54:04,669 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:54:04,669 INFO L168 Benchmark]: Boogie Preprocessor took 21.27 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-23 05:54:04,669 INFO L168 Benchmark]: RCFGBuilder took 180.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:54:04,670 INFO L168 Benchmark]: BuchiAutomizer took 3321.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -145.9 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:54:04,671 INFO L168 Benchmark]: Witness Printer took 4.43 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:54:04,674 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.27 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 180.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3321.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -145.9 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.43 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 6 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 39 SDtfs, 62 SDslu, 24 SDs, 0 SdLazy, 37 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital229 mio100 ax100 hnf99 lsp95 ukn83 mio100 lsp48 div100 bol100 ite100 ukn100 eq190 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 7 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...