./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_reverse_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_ba4480ae-9e31-4c12-b383-be2f14c232dd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ba4480ae-9e31-4c12-b383-be2f14c232dd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ba4480ae-9e31-4c12-b383-be2f14c232dd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ba4480ae-9e31-4c12-b383-be2f14c232dd/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ba4480ae-9e31-4c12-b383-be2f14c232dd/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ba4480ae-9e31-4c12-b383-be2f14c232dd/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 cd1d6be80620224d07434e02e12c771f8c62f3e2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 20:08:41,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:08:41,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:08:41,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:08:41,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:08:41,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:08:41,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:08:41,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:08:41,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:08:41,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:08:41,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:08:41,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:08:41,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:08:41,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:08:41,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:08:41,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:08:41,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:08:41,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:08:41,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:08:41,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:08:41,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:08:41,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:08:41,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:08:41,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:08:41,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:08:41,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:08:41,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:08:41,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:08:41,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:08:41,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:08:41,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:08:41,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:08:41,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:08:41,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:08:41,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:08:41,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:08:41,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:08:41,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:08:41,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:08:41,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:08:41,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:08:41,446 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ba4480ae-9e31-4c12-b383-be2f14c232dd/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 20:08:41,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:08:41,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:08:41,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:08:41,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:08:41,478 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:08:41,479 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:08:41,479 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:08:41,479 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:08:41,479 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:08:41,479 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:08:41,480 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:08:41,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:08:41,480 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:08:41,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:08:41,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:08:41,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:08:41,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:08:41,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:08:41,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:08:41,481 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:08:41,482 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:08:41,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:08:41,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:08:41,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:08:41,482 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:08:41,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:08:41,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:08:41,483 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:08:41,484 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:08:41,484 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_ba4480ae-9e31-4c12-b383-be2f14c232dd/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 -> cd1d6be80620224d07434e02e12c771f8c62f3e2 [2019-11-15 20:08:41,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:08:41,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:08:41,531 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:08:41,532 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:08:41,536 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:08:41,537 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ba4480ae-9e31-4c12-b383-be2f14c232dd/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca.i [2019-11-15 20:08:41,581 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ba4480ae-9e31-4c12-b383-be2f14c232dd/bin/uautomizer/data/cb6b55b29/d4f4d1e9e77e49e28ec28e176617b9d9/FLAGcb2b3e23a [2019-11-15 20:08:42,088 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:08:42,088 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ba4480ae-9e31-4c12-b383-be2f14c232dd/sv-benchmarks/c/termination-15/cstrncpy_reverse_alloca.i [2019-11-15 20:08:42,098 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ba4480ae-9e31-4c12-b383-be2f14c232dd/bin/uautomizer/data/cb6b55b29/d4f4d1e9e77e49e28ec28e176617b9d9/FLAGcb2b3e23a [2019-11-15 20:08:42,605 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ba4480ae-9e31-4c12-b383-be2f14c232dd/bin/uautomizer/data/cb6b55b29/d4f4d1e9e77e49e28ec28e176617b9d9 [2019-11-15 20:08:42,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:08:42,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:08:42,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:08:42,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:08:42,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:08:42,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:08:42" (1/1) ... [2019-11-15 20:08:42,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1101df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:42, skipping insertion in model container [2019-11-15 20:08:42,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:08:42" (1/1) ... [2019-11-15 20:08:42,626 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:08:42,669 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:08:43,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:08:43,067 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:08:43,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:08:43,202 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:08:43,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:43 WrapperNode [2019-11-15 20:08:43,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:08:43,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:08:43,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:08:43,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:08:43,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:43" (1/1) ... [2019-11-15 20:08:43,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:43" (1/1) ... [2019-11-15 20:08:43,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:08:43,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:08:43,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:08:43,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:08:43,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:43" (1/1) ... [2019-11-15 20:08:43,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:43" (1/1) ... [2019-11-15 20:08:43,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:43" (1/1) ... [2019-11-15 20:08:43,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:43" (1/1) ... [2019-11-15 20:08:43,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:43" (1/1) ... [2019-11-15 20:08:43,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:43" (1/1) ... [2019-11-15 20:08:43,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:43" (1/1) ... [2019-11-15 20:08:43,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:08:43,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:08:43,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:08:43,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:08:43,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4480ae-9e31-4c12-b383-be2f14c232dd/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 20:08:43,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:08:43,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:08:43,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:08:43,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:08:43,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:08:43,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:08:43,681 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:08:43,681 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:08:43,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:08:43 BoogieIcfgContainer [2019-11-15 20:08:43,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:08:43,683 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:08:43,683 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:08:43,686 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:08:43,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:08:43,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:08:42" (1/3) ... [2019-11-15 20:08:43,688 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73a85848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:08:43, skipping insertion in model container [2019-11-15 20:08:43,688 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:08:43,688 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:08:43" (2/3) ... [2019-11-15 20:08:43,688 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73a85848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:08:43, skipping insertion in model container [2019-11-15 20:08:43,688 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:08:43,689 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:08:43" (3/3) ... [2019-11-15 20:08:43,690 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncpy_reverse_alloca.i [2019-11-15 20:08:43,732 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:08:43,732 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:08:43,732 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:08:43,732 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:08:43,732 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:08:43,732 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:08:43,732 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:08:43,733 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:08:43,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 20:08:43,764 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 20:08:43,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:08:43,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:08:43,770 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:08:43,770 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:08:43,770 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:08:43,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 20:08:43,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 20:08:43,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:08:43,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:08:43,773 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:08:43,773 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:08:43,780 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 5#L385true assume !(main_~length~0 < 1); 7#L385-2true assume !(main_~n~0 < 1); 3#L388-1true call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset, 1);main_~nondetString~0.base, main_~nondetString~0.offset := main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 14#L370-2true [2019-11-15 20:08:43,780 INFO L793 eck$LassoCheckResult]: Loop: 14#L370-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset - 1;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 9#L372true assume !(0 == cstrncpy_#t~mem208);havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~mem208; 14#L370-2true [2019-11-15 20:08:43,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:43,786 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 20:08:43,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:43,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431036253] [2019-11-15 20:08:43,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:43,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:43,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:43,945 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:08:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:43,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-11-15 20:08:43,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:43,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622368334] [2019-11-15 20:08:43,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:43,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:43,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:43,968 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:08:43,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:43,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-11-15 20:08:43,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:43,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552740278] [2019-11-15 20:08:43,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:43,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:43,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:44,041 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:08:44,151 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 20:08:44,683 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-11-15 20:08:44,848 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-15 20:08:44,859 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:08:44,860 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:08:44,860 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:08:44,860 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:08:44,860 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:08:44,860 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:08:44,861 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:08:44,861 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:08:44,861 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_reverse_alloca.i_Iteration1_Lasso [2019-11-15 20:08:44,861 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:08:44,861 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:08:44,905 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 20:08:44,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-11-15 20:08:44,918 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 20:08:44,921 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 20:08:44,927 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 20:08:45,325 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-11-15 20:08:45,534 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-15 20:08:45,535 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 20:08:45,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-11-15 20:08:45,540 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 20:08:45,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:08:45,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-11-15 20:08:45,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-11-15 20:08:45,556 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 20:08:45,558 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 20:08:45,561 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 20:08:45,563 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 20:08:45,565 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 20:08:45,567 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 20:08:45,570 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 20:08:45,572 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 20:08:45,575 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 20:08:45,577 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 20:08:45,581 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 20:08:46,524 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 20:08:46,565 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:08:46,569 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:08:46,572 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 20:08:46,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:46,574 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:08:46,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:46,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:46,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:46,577 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:08:46,577 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:08:46,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:46,580 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 20:08:46,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:46,581 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:08:46,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:46,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:46,581 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:46,582 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:08:46,582 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:08:46,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:46,583 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 20:08:46,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:46,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:08:46,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:46,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:46,585 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:46,585 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:08:46,586 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:08:46,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:46,587 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 20:08:46,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:46,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:46,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:46,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:46,591 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:08:46,591 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:08:46,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:46,595 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 20:08:46,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:46,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:46,596 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:46,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:46,598 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:08:46,598 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:08:46,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:46,602 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 20:08:46,603 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:46,603 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:46,603 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:46,603 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:46,612 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:08:46,613 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:08:46,727 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:08:46,775 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 20:08:46,775 INFO L444 ModelExtractionUtils]: 25 out of 34 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-11-15 20:08:46,777 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:08:46,781 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:08:46,781 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:08:46,782 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-11-15 20:08:46,817 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2019-11-15 20:08:46,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:46,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:08:46,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:46,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:08:46,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:46,920 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 20:08:46,935 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 20:08:46,936 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-11-15 20:08:46,984 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2019-11-15 20:08:46,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 20:08:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:08:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-11-15 20:08:46,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 20:08:46,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:08:46,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:08:46,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:08:46,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 20:08:46,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:08:46,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-11-15 20:08:46,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 20:08:47,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-11-15 20:08:47,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 20:08:47,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 20:08:47,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-15 20:08:47,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:08:47,003 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 20:08:47,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-15 20:08:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-15 20:08:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 20:08:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-15 20:08:47,026 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 20:08:47,026 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 20:08:47,026 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:08:47,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-15 20:08:47,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 20:08:47,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:08:47,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:08:47,027 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:47,027 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:08:47,028 INFO L791 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 133#L-1 havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 134#L385 assume !(main_~length~0 < 1); 138#L385-2 assume !(main_~n~0 < 1); 136#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset, 1);main_~nondetString~0.base, main_~nondetString~0.offset := main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 137#L370-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset - 1;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 131#L372 assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~mem208;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 129#L375-3 [2019-11-15 20:08:47,028 INFO L793 eck$LassoCheckResult]: Loop: 129#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 130#L375-1 assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset - 1;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 129#L375-3 [2019-11-15 20:08:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:47,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-11-15 20:08:47,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:47,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176290811] [2019-11-15 20:08:47,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:47,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:47,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:47,106 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:08:47,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:47,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-11-15 20:08:47,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:47,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29670830] [2019-11-15 20:08:47,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:47,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:47,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:47,131 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:08:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:47,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-11-15 20:08:47,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:47,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410790610] [2019-11-15 20:08:47,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:47,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:47,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:47,209 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:08:47,847 WARN L191 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 133 [2019-11-15 20:08:48,044 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-15 20:08:48,046 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:08:48,046 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:08:48,046 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:08:48,046 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:08:48,047 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:08:48,047 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:08:48,047 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:08:48,047 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:08:48,047 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_reverse_alloca.i_Iteration2_Lasso [2019-11-15 20:08:48,047 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:08:48,047 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:08:48,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-11-15 20:08:48,056 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 20:08:48,062 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 20:08:48,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:08:48,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:08:48,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:08:48,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:08:48,436 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-11-15 20:08:48,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-11-15 20:08:48,523 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 20:08:48,528 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 20:08:48,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-11-15 20:08:48,533 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 20:08:48,534 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 20:08:48,535 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 20:08:48,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:08:48,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-11-15 20:08:48,540 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 20:08:48,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-11-15 20:08:48,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-11-15 20:08:49,404 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-15 20:08:49,448 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:08:49,448 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:08:49,449 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 20:08:49,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:49,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:08:49,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:49,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:49,450 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:49,451 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:08:49,451 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:08:49,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:49,452 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 20:08:49,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:49,453 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:08:49,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:49,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:49,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:49,454 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:08:49,454 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:08:49,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:49,455 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 20:08:49,455 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:49,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:08:49,456 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:49,456 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:49,456 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:49,456 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:08:49,456 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:08:49,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:49,457 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 20:08:49,458 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:49,458 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:08:49,458 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:49,458 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:49,459 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:49,459 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:08:49,459 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:08:49,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:49,460 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 20:08:49,461 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:49,461 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:49,461 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:49,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:49,463 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:08:49,463 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:08:49,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:49,465 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 20:08:49,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:49,466 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:08:49,466 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:49,466 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:49,466 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:49,467 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:08:49,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:08:49,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:49,468 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 20:08:49,468 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:49,469 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:08:49,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:49,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:49,469 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:49,470 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:08:49,470 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:08:49,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:49,471 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 20:08:49,472 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:49,472 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:49,472 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:08:49,472 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:49,473 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:08:49,474 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:08:49,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:08:49,476 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 20:08:49,476 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:08:49,477 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:08:49,477 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:08:49,477 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:08:49,490 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 20:08:49,490 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:08:49,668 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:08:49,784 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 20:08:49,785 INFO L444 ModelExtractionUtils]: 56 out of 66 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-11-15 20:08:49,785 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:08:49,787 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-15 20:08:49,787 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:08:49,788 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_cstrncpy_~us~0.base)_1) = 2*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrncpy_~us~0.base)_1 Supporting invariants [] [2019-11-15 20:08:49,823 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2019-11-15 20:08:49,828 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:08:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:49,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:08:49,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:49,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:08:49,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:08:49,878 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 20:08:49,879 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 20:08:49,879 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 20:08:49,885 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 12 states and 16 transitions. Complement of second has 4 states. [2019-11-15 20:08:49,886 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-11-15 20:08:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:08:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-11-15 20:08:49,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 20:08:49,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:08:49,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 20:08:49,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:08:49,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 20:08:49,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:08:49,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-11-15 20:08:49,889 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:08:49,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-11-15 20:08:49,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:08:49,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:08:49,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:08:49,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:08:49,890 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:08:49,890 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:08:49,890 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:08:49,890 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:08:49,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:08:49,890 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:08:49,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:08:49,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:08:49 BoogieIcfgContainer [2019-11-15 20:08:49,896 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:08:49,896 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:08:49,896 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:08:49,897 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:08:49,897 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:08:43" (3/4) ... [2019-11-15 20:08:49,900 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:08:49,900 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:08:49,902 INFO L168 Benchmark]: Toolchain (without parser) took 7291.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 935.7 MB in the beginning and 1.0 GB in the end (delta: -106.4 MB). Peak memory consumption was 83.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:49,902 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:08:49,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:49,903 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:49,904 INFO L168 Benchmark]: Boogie Preprocessor took 25.44 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 20:08:49,904 INFO L168 Benchmark]: RCFGBuilder took 403.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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:49,905 INFO L168 Benchmark]: BuchiAutomizer took 6213.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.3 MB). Peak memory consumption was 97.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:49,905 INFO L168 Benchmark]: Witness Printer took 3.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:08:49,908 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 592.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.44 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 403.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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6213.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.3 MB). Peak memory consumption was 97.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.88 ms. Allocated memory is still 1.2 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function 2 * us + unknown-#length-unknown[us] and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. 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 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 26 SDslu, 9 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital242 mio100 ax100 hnf99 lsp97 ukn86 mio100 lsp34 div100 bol100 ite100 ukn100 eq197 hnf89 smp100 dnf232 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 311ms VariablesStem: 12 VariablesLoop: 7 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...