./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca-2.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_3bc82dde-7896-4006-802f-9dc79ea72242/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3bc82dde-7896-4006-802f-9dc79ea72242/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3bc82dde-7896-4006-802f-9dc79ea72242/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3bc82dde-7896-4006-802f-9dc79ea72242/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3bc82dde-7896-4006-802f-9dc79ea72242/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3bc82dde-7896-4006-802f-9dc79ea72242/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 68c0bffd453ebe82049c8a49e9fddf725cfb9d95 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:56:12,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:12,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:12,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:12,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:12,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:12,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:12,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:12,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:12,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:12,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:12,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:12,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:12,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:12,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:12,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:12,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:12,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:12,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:12,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:12,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:12,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:12,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:12,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:12,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:12,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:12,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:12,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:12,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:12,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:12,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:12,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:12,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:12,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:12,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:12,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:12,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:12,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:12,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:12,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:12,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:12,094 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3bc82dde-7896-4006-802f-9dc79ea72242/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:56:12,107 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:12,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:12,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:12,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:12,111 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:12,112 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:12,112 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:12,112 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:12,112 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:12,112 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:12,112 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:12,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:12,113 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:12,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:12,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:12,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:12,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:12,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:12,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:12,114 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:12,114 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:12,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:12,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:12,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:12,115 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:12,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:12,115 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:12,115 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:12,116 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:12,116 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_3bc82dde-7896-4006-802f-9dc79ea72242/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 -> 68c0bffd453ebe82049c8a49e9fddf725cfb9d95 [2019-10-22 08:56:12,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:12,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:12,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:12,161 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:12,161 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:12,165 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3bc82dde-7896-4006-802f-9dc79ea72242/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca-2.i [2019-10-22 08:56:12,209 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3bc82dde-7896-4006-802f-9dc79ea72242/bin/uautomizer/data/71956a996/f35dd639fe6745d78fa584c43402fccf/FLAG64c814f19 [2019-10-22 08:56:12,659 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:12,660 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3bc82dde-7896-4006-802f-9dc79ea72242/sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca-2.i [2019-10-22 08:56:12,669 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3bc82dde-7896-4006-802f-9dc79ea72242/bin/uautomizer/data/71956a996/f35dd639fe6745d78fa584c43402fccf/FLAG64c814f19 [2019-10-22 08:56:12,679 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3bc82dde-7896-4006-802f-9dc79ea72242/bin/uautomizer/data/71956a996/f35dd639fe6745d78fa584c43402fccf [2019-10-22 08:56:12,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:12,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:12,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:12,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:12,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:12,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:12" (1/1) ... [2019-10-22 08:56:12,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1250712a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:12, skipping insertion in model container [2019-10-22 08:56:12,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:12" (1/1) ... [2019-10-22 08:56:12,696 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:12,730 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:13,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:13,064 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:13,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:13,143 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:13,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13 WrapperNode [2019-10-22 08:56:13,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:13,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:13,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:13,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:13,152 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:56:13" (1/1) ... [2019-10-22 08:56:13,169 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:56:13" (1/1) ... [2019-10-22 08:56:13,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:13,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:13,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:13,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:13,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... [2019-10-22 08:56:13,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:13,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:13,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:13,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:13,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bc82dde-7896-4006-802f-9dc79ea72242/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:56:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:13,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:13,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:13,592 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:13,593 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:56:13,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:13 BoogieIcfgContainer [2019-10-22 08:56:13,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:13,594 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:13,595 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:13,598 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:13,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:13,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:12" (1/3) ... [2019-10-22 08:56:13,600 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@681d6f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:13, skipping insertion in model container [2019-10-22 08:56:13,600 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:13,600 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:13" (2/3) ... [2019-10-22 08:56:13,601 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@681d6f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:13, skipping insertion in model container [2019-10-22 08:56:13,601 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:13,601 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:13" (3/3) ... [2019-10-22 08:56:13,603 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncmp-alloca-2.i [2019-10-22 08:56:13,647 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:13,647 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:13,647 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:13,648 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:13,648 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:13,648 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:13,648 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:13,648 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:13,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:56:13,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:13,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:13,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:13,699 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:56:13,699 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:13,699 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:13,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:56:13,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:13,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:13,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:13,702 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:56:13,702 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:13,710 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~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, 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~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 8#L565true assume !(main_~length1~0 < 1); 13#L565-2true assume !(main_~length2~0 < 1); 7#L568-1true call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 17#L550true assume !(0 == cstrncmp_~n); 4#L552-5true [2019-10-22 08:56:13,710 INFO L793 eck$LassoCheckResult]: Loop: 4#L552-5true cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 14#L552-1true assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 20#L552-3true assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~short5;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 11#L553true assume cstrncmp_#t~short7; 15#L553-2true assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 4#L552-5true [2019-10-22 08:56:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,716 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-10-22 08:56:13,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:13,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4547499] [2019-10-22 08:56:13,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:13,894 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2019-10-22 08:56:13,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:13,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589718057] [2019-10-22 08:56:13,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:13,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:13,974 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:56:13,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589718057] [2019-10-22 08:56:13,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:13,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:13,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103460099] [2019-10-22 08:56:13,980 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:13,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:13,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:13,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:13,997 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-10-22 08:56:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:14,019 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-10-22 08:56:14,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:14,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-10-22 08:56:14,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:14,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2019-10-22 08:56:14,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:14,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:14,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-10-22 08:56:14,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:14,029 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:56:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-10-22 08:56:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 08:56:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:56:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-10-22 08:56:14,055 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:56:14,055 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:56:14,056 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:14,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-10-22 08:56:14,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:56:14,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:14,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:14,057 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:56:14,057 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:14,057 INFO L791 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 46#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~ret18, 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~nondet13;havoc main_#t~nondet13;main_~length2~0 := main_#t~nondet14;havoc main_#t~nondet14; 47#L565 assume !(main_~length1~0 < 1); 53#L565-2 assume !(main_~length2~0 < 1); 54#L568-1 call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc16.base, main_#t~malloc16.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet17;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~short7, cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset, cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset, cstrncmp_#t~post2, cstrncmp_#t~mem3, cstrncmp_#t~mem4, cstrncmp_#t~short5, cstrncmp_#t~mem10, cstrncmp_#t~mem11, cstrncmp_#t~ite12, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 56#L550 assume !(0 == cstrncmp_~n); 50#L552-5 [2019-10-22 08:56:14,058 INFO L793 eck$LassoCheckResult]: Loop: 50#L552-5 cstrncmp_#t~post2 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post2 - 1;cstrncmp_#t~short5 := cstrncmp_#t~post2 > 0; 51#L552-1 assume cstrncmp_#t~short5;call cstrncmp_#t~mem3 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem4 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short5 := cstrncmp_#t~mem3 == cstrncmp_#t~mem4; 55#L552-3 assume !!cstrncmp_#t~short5;havoc cstrncmp_#t~mem3;havoc cstrncmp_#t~mem4;havoc cstrncmp_#t~post2;havoc cstrncmp_#t~short5;cstrncmp_#t~short7 := 0 == cstrncmp_~n; 48#L553 assume !cstrncmp_#t~short7;call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short7 := 0 == cstrncmp_#t~mem6; 49#L553-2 assume !cstrncmp_#t~short7;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~short7;cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post8.base, 1 + cstrncmp_#t~post8.offset;havoc cstrncmp_#t~post8.base, cstrncmp_#t~post8.offset;cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post9.base, 1 + cstrncmp_#t~post9.offset;havoc cstrncmp_#t~post9.base, cstrncmp_#t~post9.offset; 50#L552-5 [2019-10-22 08:56:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2019-10-22 08:56:14,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:14,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768612682] [2019-10-22 08:56:14,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,093 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:14,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:14,093 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2019-10-22 08:56:14,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:14,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609877011] [2019-10-22 08:56:14,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,129 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:14,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:14,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2019-10-22 08:56:14,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:14,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787805366] [2019-10-22 08:56:14,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:14,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:14,212 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:14,512 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-10-22 08:56:14,860 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-10-22 08:56:14,988 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-10-22 08:56:15,001 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:15,002 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:15,002 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:15,002 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:15,003 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:15,003 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:15,003 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:15,003 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:15,003 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncmp-alloca-2.i_Iteration2_Lasso [2019-10-22 08:56:15,003 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:15,004 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:15,023 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:56:15,028 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:56:15,031 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:56:15,033 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:56:15,037 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:56:15,039 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:56:15,042 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:56:15,045 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:56:15,047 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:56:15,050 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:56:15,052 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:56:15,054 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:56:15,059 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:56:15,061 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:56:15,064 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:56:15,066 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:56:15,078 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:56:15,080 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:56:15,083 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:56:15,085 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:56:15,086 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:56: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:56: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:56:15,403 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-10-22 08:56:15,537 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-22 08:56:15,537 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:56:15,539 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:56:15,542 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:56:15,544 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:56:16,213 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 08:56:16,349 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:16,355 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:16,356 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:56:16,357 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,358 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,358 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,358 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,358 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,360 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,362 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:56:16,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,363 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,364 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,364 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,365 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:56:16,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,368 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:56:16,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,369 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,369 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,371 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:16,372 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:16,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,375 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:56:16,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,376 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,377 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,377 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,378 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:56:16,379 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,379 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,379 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,379 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,380 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:16,381 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:16,384 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,385 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:56:16,385 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,385 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,387 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,387 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,388 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:56:16,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,389 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,389 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,389 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,391 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:56:16,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,392 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,392 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,392 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,393 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:16,393 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:16,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,396 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:56:16,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,397 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,397 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,398 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,398 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,399 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:56:16,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,400 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,400 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,400 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,401 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,401 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,402 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:56:16,402 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,403 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,403 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,403 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,404 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,405 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:56:16,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,408 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:56:16,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,409 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,409 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,409 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,409 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,410 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:56:16,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,411 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:16,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:16,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,412 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:16,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:16,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:16,413 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:56:16,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:16,414 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:56:16,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:16,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:16,416 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:56:16,417 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:16,443 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:16,461 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:56:16,461 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:56:16,464 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:16,465 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:16,465 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:16,466 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~n) = 1*ULTIMATE.start_cstrncmp_~n Supporting invariants [] [2019-10-22 08:56:16,519 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-10-22 08:56:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:16,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:16,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:16,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:16,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:16,618 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:56:16,621 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:56:16,622 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-10-22 08:56:16,663 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 21 states and 26 transitions. Complement of second has 6 states. [2019-10-22 08:56:16,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:56:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 08:56:16,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 5 letters. [2019-10-22 08:56:16,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:16,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2019-10-22 08:56:16,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:16,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 10 letters. [2019-10-22 08:56:16,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:16,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-10-22 08:56:16,669 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:16,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-10-22 08:56:16,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:56:16,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:56:16,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:56:16,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:16,670 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:16,670 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:16,671 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:16,671 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:16,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:16,671 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:16,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:56:16,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:56:16 BoogieIcfgContainer [2019-10-22 08:56:16,677 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:56:16,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:16,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:16,678 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:16,678 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:13" (3/4) ... [2019-10-22 08:56:16,681 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:56:16,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:16,683 INFO L168 Benchmark]: Toolchain (without parser) took 4001.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -118.6 MB). Peak memory consumption was 101.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:16,683 INFO L168 Benchmark]: CDTParser took 0.20 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:56:16,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:16,684 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.08 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:16,685 INFO L168 Benchmark]: Boogie Preprocessor took 23.42 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:56:16,685 INFO L168 Benchmark]: RCFGBuilder took 378.07 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:16,686 INFO L168 Benchmark]: BuchiAutomizer took 3082.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Peak memory consumption was 114.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:16,686 INFO L168 Benchmark]: Witness Printer took 4.31 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:56:16,696 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.20 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 461.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.08 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 378.07 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3082.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Peak memory consumption was 114.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.31 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 12 SDslu, 23 SDs, 0 SdLazy, 15 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital236 mio100 ax107 hnf99 lsp81 ukn85 mio100 lsp42 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf187 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 52ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...