./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 051dd1d5deb7603ef8d45e2ac843d269d4cbaf6c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:26:27,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:26:27,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:26:27,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:26:27,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:26:27,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:26:27,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:26:27,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:26:27,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:26:27,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:26:27,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:26:27,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:26:27,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:26:27,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:26:27,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:26:27,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:26:27,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:26:27,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:26:27,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:26:27,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:26:27,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:26:27,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:26:27,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:26:27,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:26:27,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:26:27,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:26:27,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:26:27,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:26:27,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:26:27,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:26:27,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:26:27,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:26:27,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:26:27,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:26:27,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:26:27,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:26:27,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:26:27,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:26:27,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:26:27,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:26:27,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:26:27,412 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:26:27,439 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:26:27,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:26:27,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:26:27,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:26:27,450 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:26:27,450 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:26:27,451 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:26:27,451 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:26:27,451 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:26:27,451 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:26:27,452 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:26:27,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:26:27,452 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:26:27,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:26:27,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:26:27,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:26:27,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:26:27,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:26:27,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:26:27,455 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:26:27,456 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:26:27,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:26:27,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:26:27,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:26:27,457 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:26:27,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:26:27,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:26:27,458 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:26:27,459 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:26:27,460 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/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 051dd1d5deb7603ef8d45e2ac843d269d4cbaf6c [2019-11-15 22:26:27,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:26:27,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:26:27,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:26:27,510 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:26:27,511 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:26:27,512 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i [2019-11-15 22:26:27,573 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/bin/uautomizer/data/9797bbe25/555c85b87317448ca183810f5ff153c4/FLAGaf7e67393 [2019-11-15 22:26:28,046 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:26:28,047 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/sv-benchmarks/c/termination-15/cstrcmp_mixed_alloca.i [2019-11-15 22:26:28,063 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/bin/uautomizer/data/9797bbe25/555c85b87317448ca183810f5ff153c4/FLAGaf7e67393 [2019-11-15 22:26:28,387 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/bin/uautomizer/data/9797bbe25/555c85b87317448ca183810f5ff153c4 [2019-11-15 22:26:28,389 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:26:28,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:26:28,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:26:28,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:26:28,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:26:28,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:26:28" (1/1) ... [2019-11-15 22:26:28,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de3efe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:28, skipping insertion in model container [2019-11-15 22:26:28,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:26:28" (1/1) ... [2019-11-15 22:26:28,405 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:26:28,460 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:26:28,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:26:28,900 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:26:28,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:26:29,002 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:26:29,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:29 WrapperNode [2019-11-15 22:26:29,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:26:29,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:26:29,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:26:29,004 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:26:29,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:29" (1/1) ... [2019-11-15 22:26:29,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:29" (1/1) ... [2019-11-15 22:26:29,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:26:29,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:26:29,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:26:29,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:26:29,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:29" (1/1) ... [2019-11-15 22:26:29,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:29" (1/1) ... [2019-11-15 22:26:29,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:29" (1/1) ... [2019-11-15 22:26:29,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:29" (1/1) ... [2019-11-15 22:26:29,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:29" (1/1) ... [2019-11-15 22:26:29,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:29" (1/1) ... [2019-11-15 22:26:29,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:29" (1/1) ... [2019-11-15 22:26:29,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:26:29,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:26:29,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:26:29,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:26:29,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bca6d8dc-ab60-4aba-b0b7-9c96a1d693e2/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-11-15 22:26:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:26:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:26:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:26:29,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:26:29,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:26:29,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:26:29,429 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:26:29,429 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:26:29,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:26:29 BoogieIcfgContainer [2019-11-15 22:26:29,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:26:29,431 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:26:29,431 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:26:29,434 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:26:29,435 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:26:29,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:26:28" (1/3) ... [2019-11-15 22:26:29,436 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@169f8012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:26:29, skipping insertion in model container [2019-11-15 22:26:29,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:26:29,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:29" (2/3) ... [2019-11-15 22:26:29,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@169f8012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:26:29, skipping insertion in model container [2019-11-15 22:26:29,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:26:29,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:26:29" (3/3) ... [2019-11-15 22:26:29,439 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcmp_mixed_alloca.i [2019-11-15 22:26:29,500 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:26:29,500 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:26:29,500 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:26:29,500 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:26:29,501 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:26:29,501 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:26:29,501 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:26:29,501 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:26:29,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 22:26:29,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:26:29,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:26:29,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:26:29,542 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:26:29,542 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:26:29,542 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:26:29,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 22:26:29,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:26:29,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:26:29,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:26:29,545 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:26:29,545 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:26:29,551 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, 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~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 17#L378true assume !(main_~length1~0 < 1); 4#L378-2true assume !(main_~length2~0 < 1); 13#L381-1true call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;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;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 7#L367-5true [2019-11-15 22:26:29,551 INFO L793 eck$LassoCheckResult]: Loop: 7#L367-5true call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 3#L367-1true assume cstrcmp_#t~short208;call cstrcmp_#t~mem206 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem207 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short208 := cstrcmp_#t~mem206 == cstrcmp_#t~mem207; 5#L367-3true assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~mem206;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 7#L367-5true [2019-11-15 22:26:29,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:29,556 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 22:26:29,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:29,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652566597] [2019-11-15 22:26:29,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:29,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:29,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:26:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:26:29,701 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:26:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:29,702 INFO L82 PathProgramCache]: Analyzing trace with hash 49755, now seen corresponding path program 1 times [2019-11-15 22:26:29,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:29,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342024667] [2019-11-15 22:26:29,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:29,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:29,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:26:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:26:29,726 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:26:29,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:29,728 INFO L82 PathProgramCache]: Analyzing trace with hash 180429558, now seen corresponding path program 1 times [2019-11-15 22:26:29,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:29,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19618244] [2019-11-15 22:26:29,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:29,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:29,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:26:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:26:29,801 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:26:29,985 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-11-15 22:26:30,422 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-11-15 22:26:30,556 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-15 22:26:30,568 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:26:30,568 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:26:30,569 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:26:30,569 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:26:30,569 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:26:30,569 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:26:30,569 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:26:30,570 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:26:30,570 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp_mixed_alloca.i_Iteration1_Lasso [2019-11-15 22:26:30,570 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:26:30,570 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:26:30,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:30,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:30,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:30,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:30,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:30,990 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-11-15 22:26:31,175 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-11-15 22:26:31,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:31,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:26:32,022 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-15 22:26:32,207 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:26:32,211 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:26:32,213 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-11-15 22:26:32,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:26:32,215 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:26:32,216 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:26:32,216 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:26:32,216 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:26:32,218 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:26:32,218 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:26:32,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:26:32,221 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-11-15 22:26:32,221 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:26:32,222 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:26:32,222 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:26:32,222 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:26:32,222 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:26:32,223 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:26:32,223 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:26:32,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:26:32,224 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-11-15 22:26:32,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:26:32,225 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:26:32,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:26:32,226 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:26:32,226 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:26:32,226 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:26:32,226 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:26:32,227 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:26:32,228 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-11-15 22:26:32,228 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:26:32,229 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:26:32,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:26:32,229 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:26:32,231 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:26:32,232 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:26:32,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:26:32,236 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-11-15 22:26:32,236 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:26:32,237 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:26:32,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:26:32,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:26:32,240 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:26:32,241 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:26:32,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:26:32,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:26:32,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:26:32,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:26:32,261 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:26:32,261 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:26:32,263 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:26:32,263 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:26:32,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:26:32,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:26:32,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:26:32,268 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:26:32,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:26:32,269 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 22:26:32,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:26:32,270 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 22:26:32,270 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:26:32,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:26:32,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:26:32,280 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:26:32,280 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:26:32,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:26:32,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:26:32,291 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:26:32,292 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:26:32,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:26:32,387 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-11-15 22:26:32,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:26:32,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:26:32,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:26:32,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:26:32,389 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:26:32,390 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:26:32,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:26:32,392 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-11-15 22:26:32,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:26:32,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:26:32,393 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:26:32,393 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:26:32,395 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:26:32,396 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:26:32,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:26:32,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-11-15 22:26:32,407 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:26:32,407 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:26:32,407 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:26:32,407 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:26:32,409 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:26:32,409 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:26:32,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:26:32,411 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-11-15 22:26:32,412 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:26:32,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:26:32,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:26:32,413 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:26:32,419 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:26:32,419 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:26:32,486 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:26:32,597 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:26:32,598 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:26:32,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:26:32,602 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:26:32,602 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:26:32,603 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset) = 2*ULTIMATE.start_cstrcmp_~s2.offset + 1 Supporting invariants [] [2019-11-15 22:26:32,659 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-11-15 22:26:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:32,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:26:32,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:26:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:32,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:26:32,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:26:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:32,788 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-11-15 22:26:32,789 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-11-15 22:26:32,839 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 39 states and 52 transitions. Complement of second has 7 states. [2019-11-15 22:26:32,841 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-11-15 22:26:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:26:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2019-11-15 22:26:32,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 22:26:32,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:26:32,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 22:26:32,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:26:32,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-15 22:26:32,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:26:32,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2019-11-15 22:26:32,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:26:32,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 15 states and 20 transitions. [2019-11-15 22:26:32,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 22:26:32,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:26:32,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-15 22:26:32,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:26:32,854 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-15 22:26:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-15 22:26:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-15 22:26:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 22:26:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-15 22:26:32,875 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 22:26:32,875 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 22:26:32,875 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:26:32,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-15 22:26:32,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:26:32,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:26:32,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:26:32,877 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:26:32,877 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:26:32,877 INFO L791 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#L-1 havoc main_#res;havoc main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, 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~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 158#L378 assume !(main_~length1~0 < 1); 165#L378-2 assume !(main_~length2~0 < 1); 166#L381-1 call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 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~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;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;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 169#L367-5 call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 159#L367-1 [2019-11-15 22:26:32,877 INFO L793 eck$LassoCheckResult]: Loop: 159#L367-1 assume !cstrcmp_#t~short208; 160#L367-3 assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~short208;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~mem206;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset - 1;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 167#L367-5 call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 159#L367-1 [2019-11-15 22:26:32,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:32,878 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-11-15 22:26:32,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:32,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757158660] [2019-11-15 22:26:32,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:32,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:32,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:26:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:26:32,909 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:26:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash 54797, now seen corresponding path program 1 times [2019-11-15 22:26:32,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:32,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115308410] [2019-11-15 22:26:32,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:32,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:32,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:32,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115308410] [2019-11-15 22:26:32,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:32,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:26:32,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349171252] [2019-11-15 22:26:32,942 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:26:32,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:32,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:26:32,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:26:32,945 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-15 22:26:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:32,958 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2019-11-15 22:26:32,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:26:32,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2019-11-15 22:26:32,959 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:26:32,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-11-15 22:26:32,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:26:32,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:26:32,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:26:32,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:26:32,960 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:26:32,960 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:26:32,960 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:26:32,960 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:26:32,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:26:32,961 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:26:32,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:26:32,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:26:32 BoogieIcfgContainer [2019-11-15 22:26:32,966 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:26:32,967 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:26:32,967 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:26:32,967 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:26:32,968 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:26:29" (3/4) ... [2019-11-15 22:26:32,970 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:26:32,971 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:26:32,972 INFO L168 Benchmark]: Toolchain (without parser) took 4581.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -121.0 MB). Peak memory consumption was 75.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:32,972 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:26:32,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:32,974 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.16 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-11-15 22:26:32,974 INFO L168 Benchmark]: Boogie Preprocessor took 46.62 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-11-15 22:26:32,975 INFO L168 Benchmark]: RCFGBuilder took 316.67 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:32,975 INFO L168 Benchmark]: BuchiAutomizer took 3535.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.0 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:32,976 INFO L168 Benchmark]: Witness Printer took 3.87 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:32,979 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 612.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.16 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 46.62 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 316.67 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3535.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.0 MB). Peak memory consumption was 67.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.87 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * s2 + 1 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 17 SDslu, 18 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital217 mio100 ax100 hnf99 lsp97 ukn86 mio100 lsp48 div100 bol100 ite100 ukn100 eq190 hnf89 smp100 dnf157 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 107ms VariablesStem: 9 VariablesLoop: 7 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...