./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/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 fcd11173df80f9a00fde2714abfd2a4ff8d40757 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:09,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:09,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:09,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:09,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:09,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:09,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:09,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:09,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:09,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:09,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:09,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:09,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:09,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:09,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:09,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:09,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:09,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:09,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:09,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:09,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:09,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:09,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:09,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:09,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:09,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:09,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:09,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:09,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:09,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:09,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:09,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:09,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:09,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:09,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:09,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:09,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:09,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:09,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:09,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:09,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:09,428 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:55:09,444 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:09,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:09,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:09,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:09,445 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:09,446 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:09,446 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:09,446 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:09,446 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:09,446 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:09,446 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:09,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:09,447 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:09,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:09,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:09,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:09,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:09,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:09,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:09,448 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:09,448 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:09,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:09,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:09,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:09,449 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:09,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:09,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:09,449 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:09,450 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:09,450 INFO L138 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_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/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 -> fcd11173df80f9a00fde2714abfd2a4ff8d40757 [2019-10-22 08:55:09,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:09,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:09,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:09,500 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:09,501 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:09,501 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2019-10-22 08:55:09,549 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/uautomizer/data/9d8400390/227dee8babf943fca4435ee884d2426d/FLAGb54bb83ee [2019-10-22 08:55:09,973 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:09,974 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2019-10-22 08:55:09,982 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/uautomizer/data/9d8400390/227dee8babf943fca4435ee884d2426d/FLAGb54bb83ee [2019-10-22 08:55:10,337 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/uautomizer/data/9d8400390/227dee8babf943fca4435ee884d2426d [2019-10-22 08:55:10,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:10,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:10,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:10,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:10,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:10,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:10" (1/1) ... [2019-10-22 08:55:10,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f126efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10, skipping insertion in model container [2019-10-22 08:55:10,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:10" (1/1) ... [2019-10-22 08:55:10,355 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:10,392 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:10,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:10,745 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:10,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:10,834 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:10,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10 WrapperNode [2019-10-22 08:55:10,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:10,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:10,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:10,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:10,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10" (1/1) ... [2019-10-22 08:55:10,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10" (1/1) ... [2019-10-22 08:55:10,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:10,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:10,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:10,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:10,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10" (1/1) ... [2019-10-22 08:55:10,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10" (1/1) ... [2019-10-22 08:55:10,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10" (1/1) ... [2019-10-22 08:55:10,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10" (1/1) ... [2019-10-22 08:55:10,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10" (1/1) ... [2019-10-22 08:55:10,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10" (1/1) ... [2019-10-22 08:55:10,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10" (1/1) ... [2019-10-22 08:55:10,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:10,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:10,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:10,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:10,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/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 [2019-10-22 08:55:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:55:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:55:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:10,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:11,286 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:11,287 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:55:11,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:11 BoogieIcfgContainer [2019-10-22 08:55:11,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:11,289 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:11,289 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:11,292 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:11,292 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:11,293 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:10" (1/3) ... [2019-10-22 08:55:11,293 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e0f55f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:11, skipping insertion in model container [2019-10-22 08:55:11,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:11,294 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:10" (2/3) ... [2019-10-22 08:55:11,294 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e0f55f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:11, skipping insertion in model container [2019-10-22 08:55:11,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:11,294 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:11" (3/3) ... [2019-10-22 08:55:11,296 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcspn_diffterm_alloca.i [2019-10-22 08:55:11,339 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:11,339 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:11,340 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:11,340 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:11,340 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:11,340 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:11,341 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:11,341 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:11,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:55:11,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:55:11,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:11,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:11,388 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:11,388 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:55:11,389 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:11,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:55:11,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:55:11,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:11,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:11,392 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:11,392 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:55:11,399 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 11#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2019-10-22 08:55:11,399 INFO L793 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2019-10-22 08:55:11,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:11,405 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:55:11,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:11,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182676209] [2019-10-22 08:55:11,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,568 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:11,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:11,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-10-22 08:55:11,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:11,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308806630] [2019-10-22 08:55:11,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:11,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308806630] [2019-10-22 08:55:11,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:11,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:11,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473670696] [2019-10-22 08:55:11,607 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:11,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:11,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:55:11,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:55:11,623 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-10-22 08:55:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:11,629 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-10-22 08:55:11,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:55:11,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-10-22 08:55:11,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:55:11,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-10-22 08:55:11,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:55:11,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:55:11,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-10-22 08:55:11,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:11,638 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:55:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-10-22 08:55:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 08:55:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:55:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-10-22 08:55:11,661 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:55:11,661 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:55:11,661 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:11,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-10-22 08:55:11,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:55:11,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:11,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:11,663 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:11,663 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:11,663 INFO L791 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2019-10-22 08:55:11,663 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2019-10-22 08:55:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:11,664 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-10-22 08:55:11,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:11,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704718362] [2019-10-22 08:55:11,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,706 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:11,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:11,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-10-22 08:55:11,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:11,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107269438] [2019-10-22 08:55:11,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,738 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-10-22 08:55:11,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:11,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053496134] [2019-10-22 08:55:11,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:11,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:11,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:11,986 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-10-22 08:55:12,220 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-10-22 08:55:12,509 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-10-22 08:55:12,626 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-10-22 08:55:12,638 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:12,639 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:12,640 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:12,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:12,640 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:12,640 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:12,641 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:12,641 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:12,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration2_Lasso [2019-10-22 08:55:12,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:12,641 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:12,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:12,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:13,040 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-10-22 08:55:13,204 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-10-22 08:55:13,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:13,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:13,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:13,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:13,759 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:55:14,013 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-10-22 08:55:14,073 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:14,078 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:14,080 INFO L120 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 [2019-10-22 08:55:14,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:14,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,082 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:14,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:14,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,088 INFO L120 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 [2019-10-22 08:55:14,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,095 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:14,096 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:14,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,105 INFO L120 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 [2019-10-22 08:55:14,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,106 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:14,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,107 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:14,107 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:14,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,108 INFO L120 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 [2019-10-22 08:55:14,109 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,109 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,109 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,113 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:14,114 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:14,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,120 INFO L120 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 [2019-10-22 08:55:14,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,121 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:14,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,121 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,121 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,121 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:14,122 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:14,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,123 INFO L120 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 [2019-10-22 08:55:14,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:14,124 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,124 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,124 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,125 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:14,125 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:14,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,126 INFO L120 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 [2019-10-22 08:55:14,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,127 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:14,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,128 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:14,128 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:14,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,129 INFO L120 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 [2019-10-22 08:55:14,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,130 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:14,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,131 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:14,131 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:14,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,132 INFO L120 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 [2019-10-22 08:55:14,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,133 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:14,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,134 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:14,134 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:14,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,135 INFO L120 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 [2019-10-22 08:55:14,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,136 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:14,136 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,136 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,137 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:14,137 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:14,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,138 INFO L120 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 [2019-10-22 08:55:14,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:14,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,139 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:14,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:14,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,140 INFO L120 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 [2019-10-22 08:55:14,141 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,141 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:14,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,141 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:14,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:14,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,143 INFO L120 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 [2019-10-22 08:55:14,144 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,144 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:14,144 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,145 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:14,145 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:14,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:14,146 INFO L120 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 [2019-10-22 08:55:14,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:14,147 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:14,147 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:14,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:14,151 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:14,151 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:14,189 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:14,228 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:14,228 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:55:14,230 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:14,231 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:14,232 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:14,232 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2019-10-22 08:55:14,260 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 08:55:14,268 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:55:14,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:14,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:14,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:14,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:14,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:14,352 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:14,353 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:55:14,402 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-10-22 08:55:14,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:14,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-10-22 08:55:14,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-10-22 08:55:14,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:14,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-10-22 08:55:14,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:14,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-10-22 08:55:14,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:14,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-10-22 08:55:14,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:14,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-10-22 08:55:14,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:55:14,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:55:14,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-10-22 08:55:14,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:14,410 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:55:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-10-22 08:55:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:55:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:55:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-10-22 08:55:14,414 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:55:14,414 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:55:14,414 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:14,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-10-22 08:55:14,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:14,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:14,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:14,417 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:14,417 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:14,417 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 177#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 179#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 189#L372-5 [2019-10-22 08:55:14,417 INFO L793 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 184#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 189#L372-5 [2019-10-22 08:55:14,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:14,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-10-22 08:55:14,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:14,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419140388] [2019-10-22 08:55:14,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:14,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:14,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:14,482 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:14,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:14,485 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-10-22 08:55:14,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:14,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550846402] [2019-10-22 08:55:14,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:14,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:14,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:14,507 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:14,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:14,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-10-22 08:55:14,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:14,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396589015] [2019-10-22 08:55:14,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:14,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:14,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:14,578 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:14,980 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-10-22 08:55:15,077 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:15,077 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:15,077 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:15,077 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:15,077 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:15,077 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:15,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:15,077 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:15,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration3_Lasso [2019-10-22 08:55:15,077 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:15,078 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:15,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,340 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-10-22 08:55:15,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:15,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:16,074 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:55:16,236 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-10-22 08:55:16,252 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:16,252 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:16,252 INFO L120 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 [2019-10-22 08:55:16,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,253 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,254 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,254 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,254 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,255 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,255 INFO L120 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 [2019-10-22 08:55:16,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,256 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,257 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:16,257 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:16,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,260 INFO L120 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 [2019-10-22 08:55:16,260 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,260 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,260 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,261 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,261 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,261 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,261 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,262 INFO L120 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 [2019-10-22 08:55:16,262 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,263 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,263 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,263 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,263 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,263 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,263 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,264 INFO L120 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 [2019-10-22 08:55:16,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,265 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,265 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,265 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,265 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,265 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,267 INFO L120 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 [2019-10-22 08:55:16,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,268 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:16,269 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:16,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,270 INFO L120 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 [2019-10-22 08:55:16,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,271 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,272 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:16,272 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:16,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,274 INFO L120 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 [2019-10-22 08:55:16,275 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,275 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,275 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,275 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,275 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,276 INFO L120 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 [2019-10-22 08:55:16,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:16,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,277 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:16,277 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:16,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:16,279 INFO L120 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 [2019-10-22 08:55:16,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:16,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:16,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:16,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:16,284 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:16,284 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:16,309 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:16,327 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:16,327 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:55:16,328 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:16,329 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:16,329 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:16,329 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-10-22 08:55:16,386 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-10-22 08:55:16,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:55:16,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:16,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:16,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:16,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:16,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:16,434 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:16,434 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:55:16,463 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-10-22 08:55:16,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:55:16,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-10-22 08:55:16,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:16,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 08:55:16,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:16,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-10-22 08:55:16,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:16,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-10-22 08:55:16,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:16,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-10-22 08:55:16,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:55:16,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:55:16,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-10-22 08:55:16,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:16,468 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-10-22 08:55:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-10-22 08:55:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-22 08:55:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:55:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-22 08:55:16,470 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 08:55:16,470 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 08:55:16,473 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:55:16,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-10-22 08:55:16,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:16,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:16,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:16,475 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:16,475 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:16,475 INFO L791 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 363#L382 assume !(main_~length1~0 < 1); 364#L382-2 assume !(main_~length2~0 < 1); 361#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 357#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 358#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 371#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 367#L372-1 assume !cstrcspn_#t~short210; 368#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 353#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 354#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 355#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 356#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 360#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 370#L372-5 [2019-10-22 08:55:16,475 INFO L793 eck$LassoCheckResult]: Loop: 370#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 365#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 366#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 370#L372-5 [2019-10-22 08:55:16,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:16,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-10-22 08:55:16,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:16,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091821213] [2019-10-22 08:55:16,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:16,505 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:16,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:16,506 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-10-22 08:55:16,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:16,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507366300] [2019-10-22 08:55:16,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:16,513 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:16,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:16,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-10-22 08:55:16,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:16,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256018546] [2019-10-22 08:55:16,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:16,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:16,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256018546] [2019-10-22 08:55:16,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299049848] [2019-10-22 08:55:16,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f00368e5-ea65-4d01-8c15-6e6d9c2fc937/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:16,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 08:55:16,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:16,689 INFO L341 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-10-22 08:55:16,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2019-10-22 08:55:16,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:16,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:16,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-22 08:55:16,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-10-22 08:55:26,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:26,899 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:26,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-10-22 08:55:26,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077088430] [2019-10-22 08:55:27,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:27,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:55:27,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2019-10-22 08:55:27,066 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 11 states. [2019-10-22 08:55:27,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:27,239 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-10-22 08:55:27,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:27,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-10-22 08:55:27,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:27,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-10-22 08:55:27,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:55:27,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:55:27,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-10-22 08:55:27,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:27,244 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-10-22 08:55:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-10-22 08:55:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-10-22 08:55:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 08:55:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-10-22 08:55:27,247 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-10-22 08:55:27,247 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-10-22 08:55:27,247 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:55:27,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-10-22 08:55:27,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:55:27,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:27,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:27,248 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:27,248 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:55:27,248 INFO L791 eck$LassoCheckResult]: Stem: 525#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 518#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 519#L382 assume !(main_~length1~0 < 1); 520#L382-2 assume !(main_~length2~0 < 1); 517#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 513#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 514#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 533#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 523#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 524#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 509#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 510#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 511#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 512#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 516#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 526#L372-5 [2019-10-22 08:55:27,249 INFO L793 eck$LassoCheckResult]: Loop: 526#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 521#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 522#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 526#L372-5 [2019-10-22 08:55:27,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-10-22 08:55:27,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:27,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191413648] [2019-10-22 08:55:27,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:27,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:27,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:27,273 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:27,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:27,273 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-10-22 08:55:27,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:27,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949676624] [2019-10-22 08:55:27,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:27,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:27,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:27,281 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:27,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-10-22 08:55:27,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:27,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591462611] [2019-10-22 08:55:27,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:27,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:27,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:27,307 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:28,003 WARN L191 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 142 [2019-10-22 08:55:28,806 WARN L191 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 114 [2019-10-22 08:55:28,808 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:28,808 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:28,808 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:28,808 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:28,808 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:28,808 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:28,808 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:28,808 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:28,808 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca.i_Iteration5_Lasso [2019-10-22 08:55:28,809 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:28,809 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:28,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:28,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:28,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:28,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:28,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:28,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:28,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:28,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:29,021 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-22 08:55:29,622 WARN L191 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 102 [2019-10-22 08:55:29,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:29,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:29,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:29,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:29,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:29,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:29,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:29,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:29,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:29,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:30,326 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:55:30,916 WARN L191 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-10-22 08:55:31,041 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-10-22 08:55:31,050 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:31,050 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:31,050 INFO L120 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 [2019-10-22 08:55:31,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:31,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:31,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:31,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:31,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:31,051 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:31,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:31,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:31,052 INFO L120 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 [2019-10-22 08:55:31,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:31,053 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:31,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:31,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:31,053 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:31,053 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:31,053 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:31,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:31,054 INFO L120 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 [2019-10-22 08:55:31,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:31,055 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:31,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:31,055 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:31,055 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:31,055 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:31,056 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:31,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:31,056 INFO L120 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 [2019-10-22 08:55:31,056 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:31,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:31,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:31,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:31,057 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:31,057 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:31,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:31,060 INFO L120 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 [2019-10-22 08:55:31,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:31,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:31,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:31,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:31,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:31,060 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:31,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:31,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:31,061 INFO L120 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 [2019-10-22 08:55:31,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:31,062 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:31,062 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:31,062 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:31,062 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:31,063 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:31,063 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:31,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:31,063 INFO L120 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 [2019-10-22 08:55:31,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:31,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:31,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:31,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:31,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:31,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:31,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:31,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:31,065 INFO L120 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 [2019-10-22 08:55:31,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:31,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:31,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:31,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:31,067 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:31,067 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:31,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:31,072 INFO L120 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 [2019-10-22 08:55:31,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:31,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:31,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:31,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:31,073 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:31,073 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:31,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:31,075 INFO L120 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 [2019-10-22 08:55:31,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:31,076 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:55:31,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:31,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:31,080 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:55:31,080 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:31,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:31,097 INFO L120 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 [2019-10-22 08:55:31,097 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:31,097 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:31,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:31,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:31,100 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:31,100 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:31,120 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:31,166 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:31,166 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:55:31,167 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:31,167 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:31,168 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:31,168 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-10-22 08:55:31,276 INFO L297 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2019-10-22 08:55:31,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:55:31,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:31,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:31,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:31,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:31,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:31,317 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:31,317 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:55:31,337 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-10-22 08:55:31,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:55:31,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:55:31,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:31,340 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:31,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:31,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:31,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:31,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:31,376 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:31,376 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:55:31,398 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-10-22 08:55:31,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:55:31,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:55:31,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:31,399 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:55:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:31,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:31,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:31,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:31,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:31,449 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:55:31,449 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:55:31,467 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2019-10-22 08:55:31,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-10-22 08:55:31,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:55:31,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:31,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 08:55:31,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:31,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-10-22 08:55:31,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:31,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-10-22 08:55:31,474 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:31,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-10-22 08:55:31,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:31,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:31,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:31,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:31,475 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:31,475 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:31,475 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:31,475 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:55:31,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:31,475 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:31,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:55:31,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:31 BoogieIcfgContainer [2019-10-22 08:55:31,479 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:31,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:31,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:31,480 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:31,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:11" (3/4) ... [2019-10-22 08:55:31,484 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:31,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:31,486 INFO L168 Benchmark]: Toolchain (without parser) took 21145.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.7 MB). Free memory was 939.2 MB in the beginning and 998.9 MB in the end (delta: -59.8 MB). Peak memory consumption was 224.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:31,486 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:31,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:31,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.06 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. [2019-10-22 08:55:31,488 INFO L168 Benchmark]: Boogie Preprocessor took 36.27 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:31,488 INFO L168 Benchmark]: RCFGBuilder took 370.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:31,488 INFO L168 Benchmark]: BuchiAutomizer took 20190.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.7 MB). Peak memory consumption was 226.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:31,489 INFO L168 Benchmark]: Witness Printer took 5.00 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 998.9 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:31,492 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 493.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.06 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. * Boogie Preprocessor took 36.27 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 370.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20190.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.7 MB). Peak memory consumption was 226.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.00 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 998.9 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. 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 - 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 19.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 106 SDtfs, 147 SDslu, 80 SDs, 0 SdLazy, 140 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital381 mio100 ax100 hnf99 lsp91 ukn73 mio100 lsp32 div127 bol100 ite100 ukn100 eq167 hnf81 smp88 dnf1011 smp36 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 11 VariablesLoop: 8 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...