./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/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 32bit --witnessprinter.graph.data.programhash f68b319d77fa756392ca29e618a1e0accd9b6c9e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:02,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:02,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:02,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:02,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:02,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:02,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:02,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:02,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:02,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:02,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:02,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:02,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:02,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:02,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:02,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:02,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:02,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:02,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:02,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:02,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:02,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:02,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:02,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:02,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:02,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:02,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:02,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:02,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:02,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:02,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:02,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:02,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:02,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:02,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:02,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:02,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:02,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:02,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:02,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:02,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:02,567 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:56:02,586 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:02,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:02,590 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:02,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:02,592 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:02,593 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:02,593 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:02,593 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:02,593 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:02,593 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:02,593 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:02,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:02,594 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:02,594 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:02,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:02,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:02,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:02,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:02,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:02,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:02,595 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:02,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:02,595 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:02,596 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:02,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:02,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:02,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:02,596 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:02,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:02,597 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:02,597 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:02,598 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:02,598 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_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f68b319d77fa756392ca29e618a1e0accd9b6c9e [2019-10-22 08:56:02,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:02,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:02,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:02,639 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:02,640 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:02,640 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-10-22 08:56:02,687 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/bin/uautomizer/data/c80b6875a/83980c8827d84f5faeca147b53471566/FLAGfa3ead3fe [2019-10-22 08:56:03,159 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:03,160 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-10-22 08:56:03,172 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/bin/uautomizer/data/c80b6875a/83980c8827d84f5faeca147b53471566/FLAGfa3ead3fe [2019-10-22 08:56:03,662 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/bin/uautomizer/data/c80b6875a/83980c8827d84f5faeca147b53471566 [2019-10-22 08:56:03,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:03,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:03,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:03,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:03,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:03,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:03" (1/1) ... [2019-10-22 08:56:03,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2396d7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:03, skipping insertion in model container [2019-10-22 08:56:03,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:03" (1/1) ... [2019-10-22 08:56:03,684 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:03,734 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:04,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:04,146 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:04,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:04,251 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:04,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:04 WrapperNode [2019-10-22 08:56:04,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:04,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:04,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:04,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:04,263 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:04" (1/1) ... [2019-10-22 08:56:04,277 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:04" (1/1) ... [2019-10-22 08:56:04,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:04,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:04,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:04,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:04,309 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:04" (1/1) ... [2019-10-22 08:56:04,310 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:04" (1/1) ... [2019-10-22 08:56:04,314 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:04" (1/1) ... [2019-10-22 08:56:04,315 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:04" (1/1) ... [2019-10-22 08:56:04,322 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:04" (1/1) ... [2019-10-22 08:56:04,327 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:04" (1/1) ... [2019-10-22 08:56:04,328 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:04" (1/1) ... [2019-10-22 08:56:04,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:04,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:04,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:04,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:04,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3d9e1e7-b88d-4bc1-a4a8-d1c30d1e87a9/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:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:04,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:04,794 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:04,795 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 08:56:04,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:04 BoogieIcfgContainer [2019-10-22 08:56:04,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:04,797 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:04,797 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:04,802 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:04,807 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:04,807 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:03" (1/3) ... [2019-10-22 08:56:04,809 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d2adf07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:04, skipping insertion in model container [2019-10-22 08:56:04,809 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:04,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:04" (2/3) ... [2019-10-22 08:56:04,809 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d2adf07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:04, skipping insertion in model container [2019-10-22 08:56:04,809 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:04,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:04" (3/3) ... [2019-10-22 08:56:04,811 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcmp-alloca-1.i [2019-10-22 08:56:04,880 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:04,881 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:04,881 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:04,881 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:04,881 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:04,882 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:04,882 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:04,882 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:04,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-10-22 08:56:04,929 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:56:04,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:04,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:04,938 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:04,939 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:04,939 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:04,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-10-22 08:56:04,941 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-10-22 08:56:04,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:04,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:04,941 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:04,942 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:04,950 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L524true assume !(main_~length1~0 < 1); 12#L524-2true assume !(main_~length2~0 < 1); 3#L527-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 16#L533-3true [2019-10-22 08:56:04,951 INFO L793 eck$LassoCheckResult]: Loop: 16#L533-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 15#L533-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 16#L533-3true [2019-10-22 08:56:04,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:56:04,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:04,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154613159] [2019-10-22 08:56:04,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:05,136 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:05,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:05,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-10-22 08:56:05,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:05,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262829545] [2019-10-22 08:56:05,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:05,158 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-10-22 08:56:05,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:05,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208536496] [2019-10-22 08:56:05,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:05,220 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:05,469 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-10-22 08:56:05,600 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-10-22 08:56:05,614 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:05,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:05,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:05,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:05,616 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:05,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:05,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:05,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:05,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-1.i_Iteration1_Lasso [2019-10-22 08:56:05,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:05,617 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:05,659 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:05,667 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:05,672 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:05,674 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:05,681 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:05,684 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:05,686 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:05,691 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:05,698 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:05,701 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:05,881 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-22 08:56:05,911 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:05,915 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:05,920 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:05,926 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:05,929 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:06,314 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:56:06,420 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:06,428 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:06,430 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:06,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,433 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,434 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,434 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,435 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,437 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,438 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,442 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:06,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,443 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,448 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,449 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,449 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,451 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:06,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,461 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,461 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,461 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,462 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,462 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,464 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:06,464 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,465 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,471 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,473 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,478 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:06,478 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,479 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,479 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,479 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,484 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,485 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,492 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:06,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,494 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,496 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,497 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,500 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:06,501 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,501 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,501 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,502 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,504 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,506 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,529 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:06,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,531 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,534 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,534 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,539 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:06,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,540 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,541 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,541 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,542 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,543 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:06,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,544 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,545 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,545 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,547 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,549 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,562 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:06,562 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,563 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,563 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,563 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,565 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,565 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,576 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:06,577 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,577 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:06,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,578 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,578 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,578 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:06,579 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:06,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,581 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:06,581 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,582 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:56:06,582 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,587 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:56:06,587 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:06,640 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:06,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:06,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:06,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:06,641 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:06,644 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:06,645 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:06,730 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:06,752 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:56:06,755 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:56:06,765 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:06,767 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:06,771 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:06,772 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:56:06,794 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:56:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:06,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:06,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:06,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:06,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:06,893 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:06,908 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:56:06,909 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2019-10-22 08:56:06,978 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 45 states and 64 transitions. Complement of second has 7 states. [2019-10-22 08:56:06,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2019-10-22 08:56:06,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:56:06,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:06,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:56:06,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:06,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:56:06,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:06,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 64 transitions. [2019-10-22 08:56:07,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:56:07,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 15 states and 20 transitions. [2019-10-22 08:56:07,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:56:07,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:56:07,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-10-22 08:56:07,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:07,013 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:56:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-10-22 08:56:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 08:56:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:56:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-10-22 08:56:07,053 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:56:07,053 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 08:56:07,053 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:07,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-10-22 08:56:07,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:56:07,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:07,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:07,057 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:07,057 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:07,057 INFO L791 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 142#L524 assume !(main_~length1~0 < 1); 143#L524-2 assume !(main_~length2~0 < 1); 136#L527-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 137#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 150#L533-4 main_~i~1 := 0; 141#L537-3 [2019-10-22 08:56:07,057 INFO L793 eck$LassoCheckResult]: Loop: 141#L537-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 140#L537-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 141#L537-3 [2019-10-22 08:56:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:07,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-10-22 08:56:07,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:07,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327407880] [2019-10-22 08:56:07,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,106 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:07,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-10-22 08:56:07,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:07,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216109770] [2019-10-22 08:56:07,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,118 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:07,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:07,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-10-22 08:56:07,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:07,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641577189] [2019-10-22 08:56:07,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:07,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:07,149 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:07,351 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:07,351 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:07,352 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:07,352 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:07,352 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:07,352 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:07,352 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:07,352 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:07,352 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-1.i_Iteration2_Lasso [2019-10-22 08:56:07,353 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:07,353 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:07,359 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:07,364 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:07,367 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:07,496 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-22 08:56:07,519 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:07,522 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:07,525 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:07,531 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:07,538 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:07,541 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:07,543 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:07,547 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:07,550 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:07,553 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:07,555 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:07,899 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:56:07,943 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:07,943 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:07,944 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:07,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:07,944 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:07,945 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:07,945 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:07,945 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:07,945 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:07,945 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:07,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:07,947 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:07,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:07,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:07,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:07,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:07,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:07,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:07,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:07,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:07,950 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:07,950 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:07,950 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:07,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:07,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:07,952 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:07,953 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:07,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:07,957 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:07,958 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:07,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:07,958 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:07,958 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:07,961 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:07,961 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:07,989 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:08,046 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:56:08,046 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:56:08,047 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:08,048 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:08,049 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:08,049 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-10-22 08:56:08,073 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:56:08,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:08,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:08,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:08,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:08,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:08,137 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:08,138 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:56:08,138 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 08:56:08,170 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 21 states and 30 transitions. Complement of second has 6 states. [2019-10-22 08:56:08,171 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:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-10-22 08:56:08,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:56:08,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:08,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:56:08,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:08,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:56:08,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:08,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2019-10-22 08:56:08,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:56:08,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2019-10-22 08:56:08,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:08,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:56:08,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-10-22 08:56:08,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:08,178 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 08:56:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-10-22 08:56:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 08:56:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:56:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-10-22 08:56:08,180 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 08:56:08,180 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 08:56:08,181 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:08,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-10-22 08:56:08,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:56:08,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:08,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:08,182 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:08,182 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:56:08,182 INFO L791 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 252#L524 assume !(main_~length1~0 < 1); 253#L524-2 assume !(main_~length2~0 < 1); 246#L527-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 247#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 261#L533-4 main_~i~1 := 0; 255#L537-3 assume !(main_~i~1 < main_~length2~0 - 1); 256#L537-4 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);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset; 254#L516-3 [2019-10-22 08:56:08,182 INFO L793 eck$LassoCheckResult]: Loop: 254#L516-3 call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); 248#L516-1 assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); 249#L517 assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset;havoc cstrcmp_#t~mem6; 254#L516-3 [2019-10-22 08:56:08,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:08,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-10-22 08:56:08,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:08,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914186291] [2019-10-22 08:56:08,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,235 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:08,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:08,239 INFO L82 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 1 times [2019-10-22 08:56:08,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:08,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790444464] [2019-10-22 08:56:08,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,251 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:08,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:08,252 INFO L82 PathProgramCache]: Analyzing trace with hash -296047681, now seen corresponding path program 1 times [2019-10-22 08:56:08,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:08,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495654530] [2019-10-22 08:56:08,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:08,461 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:08,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495654530] [2019-10-22 08:56:08,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:08,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:56:08,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807421700] [2019-10-22 08:56:08,577 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-10-22 08:56:08,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:08,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:56:08,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:08,621 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-10-22 08:56:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:08,746 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-10-22 08:56:08,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:56:08,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-10-22 08:56:08,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:56:08,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 22 transitions. [2019-10-22 08:56:08,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:56:08,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:56:08,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-10-22 08:56:08,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:08,749 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-10-22 08:56:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-10-22 08:56:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-10-22 08:56:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:56:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-10-22 08:56:08,750 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-10-22 08:56:08,751 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-10-22 08:56:08,751 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:08,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-10-22 08:56:08,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:56:08,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:08,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:08,756 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:08,756 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:56:08,757 INFO L791 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 314#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 309#L524 assume !(main_~length1~0 < 1); 310#L524-2 assume !(main_~length2~0 < 1); 303#L527-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 304#L533-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 316#L533-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 317#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 318#L533-4 main_~i~1 := 0; 312#L537-3 assume !(main_~i~1 < main_~length2~0 - 1); 313#L537-4 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);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset; 311#L516-3 [2019-10-22 08:56:08,757 INFO L793 eck$LassoCheckResult]: Loop: 311#L516-3 call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); 305#L516-1 assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); 306#L517 assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset;havoc cstrcmp_#t~mem6; 311#L516-3 [2019-10-22 08:56:08,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-10-22 08:56:08,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:08,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728781303] [2019-10-22 08:56:08,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,788 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:08,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:08,791 INFO L82 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 2 times [2019-10-22 08:56:08,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:08,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195108121] [2019-10-22 08:56:08,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:08,813 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:08,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1311502365, now seen corresponding path program 1 times [2019-10-22 08:56:08,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:08,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953232469] [2019-10-22 08:56:08,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:08,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:56:09,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953232469] [2019-10-22 08:56:09,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:09,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:56:09,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569732506] [2019-10-22 08:56:09,129 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-10-22 08:56:09,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:09,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:56:09,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:56:09,165 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 9 states. [2019-10-22 08:56:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:09,299 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-10-22 08:56:09,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:56:09,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2019-10-22 08:56:09,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:56:09,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2019-10-22 08:56:09,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:56:09,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:56:09,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-10-22 08:56:09,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:09,302 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 08:56:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-10-22 08:56:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-10-22 08:56:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:56:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-10-22 08:56:09,307 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 08:56:09,307 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 08:56:09,307 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:56:09,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-10-22 08:56:09,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:56:09,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:09,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:09,308 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:09,308 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:56:09,308 INFO L791 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 366#L524 assume !(main_~length1~0 < 1); 367#L524-2 assume !(main_~length2~0 < 1); 360#L527-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 361#L533-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 373#L533-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 374#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 375#L533-4 main_~i~1 := 0; 369#L537-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 364#L537-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 365#L537-3 assume !(main_~i~1 < main_~length2~0 - 1); 370#L537-4 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);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset; 368#L516-3 [2019-10-22 08:56:09,309 INFO L793 eck$LassoCheckResult]: Loop: 368#L516-3 call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); 362#L516-1 assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); 363#L517 assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset;havoc cstrcmp_#t~mem6; 368#L516-3 [2019-10-22 08:56:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:09,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-10-22 08:56:09,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:09,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20376600] [2019-10-22 08:56:09,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:09,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:09,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:09,352 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:09,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 3 times [2019-10-22 08:56:09,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:09,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775216519] [2019-10-22 08:56:09,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:09,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:09,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:09,367 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:09,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:09,368 INFO L82 PathProgramCache]: Analyzing trace with hash -718433093, now seen corresponding path program 1 times [2019-10-22 08:56:09,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:09,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511788639] [2019-10-22 08:56:09,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:09,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:09,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:09,414 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:09,855 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 111 [2019-10-22 08:56:09,978 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-22 08:56:09,999 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:09,999 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:09,999 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:09,999 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:10,000 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:10,000 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:10,000 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:10,000 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:10,000 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-1.i_Iteration5_Lasso [2019-10-22 08:56:10,000 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:10,000 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:10,004 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:10,015 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:10,017 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:10,019 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:10,021 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:10,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:10,025 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:10,026 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:10,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:10,030 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:10,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:10,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:10,035 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:10,038 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:10,040 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:10,043 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:10,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:10,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:10,049 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:10,051 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:10,053 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:10,055 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:10,450 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-10-22 08:56:10,652 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-10-22 08:56:10,652 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:10,655 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:10,656 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:10,657 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:11,184 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-10-22 08:56:11,319 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:11,320 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:11,320 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:11,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,321 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,321 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,321 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,321 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,321 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,321 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,322 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:11,323 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,323 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,323 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,324 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,324 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,325 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:11,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,325 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,326 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,326 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,328 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:11,328 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,329 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,329 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,331 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:11,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,332 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,332 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,332 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,332 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,333 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:11,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,334 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,334 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,336 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:11,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,336 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,338 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:11,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,338 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,338 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,339 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,339 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,340 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:11,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,341 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,341 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,341 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,341 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,341 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,342 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,343 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:11,343 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,343 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,343 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,344 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,344 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,345 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:11,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,345 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,346 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,346 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,348 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:11,348 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,348 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,349 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,349 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,349 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,349 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,350 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:11,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,352 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,352 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,353 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:11,353 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,353 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,354 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,354 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,355 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:11,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,357 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,357 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,359 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:11,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,360 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,360 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,361 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:11,361 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,362 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,363 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,364 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:11,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,365 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,365 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,365 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,365 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,366 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,366 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,366 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:11,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,367 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,368 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,368 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,368 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,369 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:11,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,369 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,370 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,370 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,370 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,372 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:11,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,373 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:11,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,373 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:11,374 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:11,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,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:11,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,375 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,375 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,375 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,377 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,377 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,382 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:11,382 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,382 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,383 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,383 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,384 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,386 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:11,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,386 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:56:11,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,390 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:56:11,390 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,407 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:11,407 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,409 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,409 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,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:11,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,411 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,412 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,413 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,417 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:11,418 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,418 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,418 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,419 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,420 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:11,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,421 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:56:11,421 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,424 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-10-22 08:56:11,424 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:56:11,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:11,435 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:11,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:11,436 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:11,436 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:11,436 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:11,439 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:11,439 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:11,527 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:11,628 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:56:11,628 INFO L444 ModelExtractionUtils]: 39 out of 49 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-10-22 08:56:11,629 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:11,629 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:11,630 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:11,630 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset, v_rep(select #length ULTIMATE.start_cstrcmp_~s2.base)_1) = -1*ULTIMATE.start_cstrcmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_cstrcmp_~s2.base)_1 Supporting invariants [] [2019-10-22 08:56:11,699 INFO L297 tatePredicateManager]: 22 out of 22 supporting invariants were superfluous and have been removed [2019-10-22 08:56:11,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:56:11,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:11,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:11,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:11,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:56:11,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:11,760 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:11,761 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:56:11,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 08:56:11,769 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 23 transitions. Complement of second has 4 states. [2019-10-22 08:56:11,770 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:56:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-10-22 08:56:11,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2019-10-22 08:56:11,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:11,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2019-10-22 08:56:11,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:11,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2019-10-22 08:56:11,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:11,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2019-10-22 08:56:11,773 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:11,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-10-22 08:56:11,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:56:11,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:56:11,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:56:11,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:11,773 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:11,773 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:11,773 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:11,773 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:56:11,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:11,774 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:11,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:56:11,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:56:11 BoogieIcfgContainer [2019-10-22 08:56:11,781 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:56:11,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:11,782 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:11,782 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:11,782 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:04" (3/4) ... [2019-10-22 08:56:11,786 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:56:11,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:11,788 INFO L168 Benchmark]: Toolchain (without parser) took 8121.91 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.9 MB). Free memory was 939.1 MB in the beginning and 1.0 GB in the end (delta: -83.8 MB). Peak memory consumption was 249.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:11,789 INFO L168 Benchmark]: CDTParser took 0.15 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:11,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:11,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.92 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:11,790 INFO L168 Benchmark]: Boogie Preprocessor took 32.40 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:11,791 INFO L168 Benchmark]: RCFGBuilder took 464.72 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: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:11,791 INFO L168 Benchmark]: BuchiAutomizer took 6984.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.0 MB). Peak memory consumption was 258.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:11,792 INFO L168 Benchmark]: Witness Printer took 4.86 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:11,794 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.15 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 585.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.92 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.40 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 464.72 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: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6984.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.0 MB). Peak memory consumption was 258.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.86 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[s2] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 6.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 70 SDtfs, 117 SDslu, 99 SDs, 0 SdLazy, 99 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax110 hnf98 lsp84 ukn74 mio100 lsp47 div100 bol100 ite100 ukn100 eq178 hnf89 smp100 dnf156 smp95 tf100 neg94 sie122 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...