./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strcmp_short_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/strcmp_short_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 d1a5f8ddb22d6de2b22e195cabe7484ea1e11662 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:17:53,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:17:53,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:17:53,908 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:17:53,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:17:53,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:17:53,915 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:17:53,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:17:53,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:17:53,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:17:53,924 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:17:53,924 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:17:53,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:17:53,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:17:53,932 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:17:53,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:17:53,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:17:53,940 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:17:53,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:17:53,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:17:53,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:17:53,950 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:17:53,958 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:17:53,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:17:53,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:17:53,959 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:17:53,963 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:17:53,966 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:17:53,967 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:17:53,968 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:17:53,968 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:17:53,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:17:53,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:17:53,971 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:17:53,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:17:53,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:17:53,973 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:17:53,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:17:53,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:17:53,990 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:17:53,990 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:17:53,990 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:17:53,991 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:17:53,991 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:17:53,991 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:17:53,991 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:17:53,991 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:17:53,992 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:17:53,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:17:53,992 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:17:53,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:17:53,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:17:53,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:17:53,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:17:53,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:17:53,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:17:53,993 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:17:53,993 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:17:53,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:17:53,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:17:53,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:17:53,994 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:17:53,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:17:53,994 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:17:53,995 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:17:54,000 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:17:54,000 INFO L133 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> d1a5f8ddb22d6de2b22e195cabe7484ea1e11662 [2018-11-28 23:17:54,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:17:54,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:17:54,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:17:54,061 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:17:54,061 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:17:54,062 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strcmp_short_true-termination.c.i [2018-11-28 23:17:54,127 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9892d98cf/812bb851251a4abc9d13c525eb9c64e9/FLAG7531db855 [2018-11-28 23:17:54,699 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:17:54,700 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strcmp_short_true-termination.c.i [2018-11-28 23:17:54,714 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9892d98cf/812bb851251a4abc9d13c525eb9c64e9/FLAG7531db855 [2018-11-28 23:17:54,984 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9892d98cf/812bb851251a4abc9d13c525eb9c64e9 [2018-11-28 23:17:54,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:17:54,990 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:17:54,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:17:54,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:17:54,998 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:17:54,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:54" (1/1) ... [2018-11-28 23:17:55,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef360e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55, skipping insertion in model container [2018-11-28 23:17:55,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:54" (1/1) ... [2018-11-28 23:17:55,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:17:55,070 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:17:55,381 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:17:55,399 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:17:55,494 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:17:55,569 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:17:55,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55 WrapperNode [2018-11-28 23:17:55,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:17:55,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:17:55,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:17:55,570 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:17:55,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55" (1/1) ... [2018-11-28 23:17:55,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55" (1/1) ... [2018-11-28 23:17:55,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:17:55,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:17:55,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:17:55,698 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:17:55,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55" (1/1) ... [2018-11-28 23:17:55,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55" (1/1) ... [2018-11-28 23:17:55,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55" (1/1) ... [2018-11-28 23:17:55,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55" (1/1) ... [2018-11-28 23:17:55,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55" (1/1) ... [2018-11-28 23:17:55,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55" (1/1) ... [2018-11-28 23:17:55,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55" (1/1) ... [2018-11-28 23:17:55,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:17:55,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:17:55,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:17:55,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:17:55,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-11-28 23:17:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:17:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:17:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:17:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:17:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:17:55,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:17:56,203 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:17:56,203 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:17:56,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:56 BoogieIcfgContainer [2018-11-28 23:17:56,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:17:56,205 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:17:56,205 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:17:56,209 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:17:56,210 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:56,210 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:17:54" (1/3) ... [2018-11-28 23:17:56,211 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55262e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:17:56, skipping insertion in model container [2018-11-28 23:17:56,211 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:56,212 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:55" (2/3) ... [2018-11-28 23:17:56,212 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55262e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:17:56, skipping insertion in model container [2018-11-28 23:17:56,212 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:56,212 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:56" (3/3) ... [2018-11-28 23:17:56,214 INFO L375 chiAutomizerObserver]: Analyzing ICFG strcmp_short_true-termination.c.i [2018-11-28 23:17:56,274 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:17:56,274 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:17:56,275 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:17:56,275 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:17:56,275 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:17:56,275 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:17:56,275 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:17:56,275 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:17:56,276 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:17:56,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:17:56,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:17:56,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:56,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:56,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:17:56,326 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:56,327 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:17:56,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:17:56,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:17:56,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:56,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:56,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:17:56,330 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:56,337 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 9#L513true assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 12#L517true assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcmp_#in~s1.base, strcmp_#in~s1.offset, strcmp_#in~s2.base, strcmp_#in~s2.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcmp_#res;havoc strcmp_#t~post6.base, strcmp_#t~post6.offset, strcmp_#t~post7.base, strcmp_#t~post7.offset, strcmp_#t~mem4, strcmp_#t~mem2, strcmp_#t~mem3, strcmp_#t~short5, strcmp_#t~mem8, strcmp_#t~mem9, strcmp_~s1.base, strcmp_~s1.offset, strcmp_~s2.base, strcmp_~s2.offset;strcmp_~s1.base, strcmp_~s1.offset := strcmp_#in~s1.base, strcmp_#in~s1.offset;strcmp_~s2.base, strcmp_~s2.offset := strcmp_#in~s2.base, strcmp_#in~s2.offset; 10#L507-5true [2018-11-28 23:17:56,338 INFO L796 eck$LassoCheckResult]: Loop: 10#L507-5true call strcmp_#t~mem4 := read~int(strcmp_~s1.base, strcmp_~s1.offset, 1);strcmp_#t~short5 := 0 != strcmp_#t~mem4; 14#L507-1true assume strcmp_#t~short5;call strcmp_#t~mem2 := read~int(strcmp_~s1.base, strcmp_~s1.offset, 1);call strcmp_#t~mem3 := read~int(strcmp_~s2.base, strcmp_~s2.offset, 1);strcmp_#t~short5 := strcmp_#t~mem2 == strcmp_#t~mem3; 6#L507-3true assume !!strcmp_#t~short5;havoc strcmp_#t~mem2;havoc strcmp_#t~mem3;havoc strcmp_#t~mem4;havoc strcmp_#t~short5;strcmp_#t~post6.base, strcmp_#t~post6.offset := strcmp_~s1.base, strcmp_~s1.offset;strcmp_~s1.base, strcmp_~s1.offset := strcmp_#t~post6.base, 1 + strcmp_#t~post6.offset;havoc strcmp_#t~post6.base, strcmp_#t~post6.offset;strcmp_#t~post7.base, strcmp_#t~post7.offset := strcmp_~s2.base, strcmp_~s2.offset;strcmp_~s2.base, strcmp_~s2.offset := strcmp_#t~post7.base, 1 + strcmp_#t~post7.offset;havoc strcmp_#t~post7.base, strcmp_#t~post7.offset; 10#L507-5true [2018-11-28 23:17:56,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:56,346 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-28 23:17:56,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:56,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:56,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:56,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:56,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:56,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 1 times [2018-11-28 23:17:56,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:56,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:56,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:56,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:56,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907761, now seen corresponding path program 1 times [2018-11-28 23:17:56,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:56,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:56,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:56,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:56,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:57,421 WARN L180 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-11-28 23:17:58,454 WARN L180 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2018-11-28 23:17:58,567 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:58,568 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:58,568 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:58,568 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:58,569 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:58,569 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:58,569 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:58,569 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:58,569 INFO L131 ssoRankerPreferences]: Filename of dumped script: strcmp_short_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:17:58,570 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:58,570 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:58,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:58,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:59,184 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-11-28 23:17:59,373 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-28 23:17:59,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:59,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:59,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:00,173 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:00,179 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:00,182 INFO L122 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 [2018-11-28 23:18:00,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,192 INFO L122 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 [2018-11-28 23:18:00,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:00,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:00,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,202 INFO L122 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 [2018-11-28 23:18:00,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:00,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:00,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,211 INFO L122 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 [2018-11-28 23:18:00,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,216 INFO L122 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 [2018-11-28 23:18:00,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,221 INFO L122 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 [2018-11-28 23:18:00,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,226 INFO L122 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 [2018-11-28 23:18:00,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,232 INFO L122 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 [2018-11-28 23:18:00,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,237 INFO L122 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 [2018-11-28 23:18:00,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,242 INFO L122 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 [2018-11-28 23:18:00,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,248 INFO L122 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 [2018-11-28 23:18:00,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,253 INFO L122 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 [2018-11-28 23:18:00,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,259 INFO L122 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 [2018-11-28 23:18:00,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,265 INFO L122 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 [2018-11-28 23:18:00,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:00,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:00,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:00,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:00,270 INFO L122 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 [2018-11-28 23:18:00,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:00,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:00,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:00,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:00,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:00,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:00,433 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:00,513 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:18:00,514 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:18:00,516 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:00,518 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:00,519 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:00,520 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcmp_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1) = -1*ULTIMATE.start_strcmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 Supporting invariants [] [2018-11-28 23:18:00,640 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 23:18:00,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:00,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:00,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:00,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:00,844 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:18:00,846 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2018-11-28 23:18:00,978 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 35 states and 43 transitions. Complement of second has 9 states. [2018-11-28 23:18:00,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:18:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-28 23:18:00,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 23:18:00,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:00,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:18:00,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:00,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:18:00,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:00,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2018-11-28 23:18:00,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:18:00,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 14 states and 17 transitions. [2018-11-28 23:18:00,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:18:00,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:18:00,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-28 23:18:00,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:00,998 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 23:18:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-28 23:18:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-28 23:18:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:18:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-28 23:18:01,028 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 23:18:01,028 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-28 23:18:01,028 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:18:01,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-28 23:18:01,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:18:01,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:01,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:01,029 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:18:01,029 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:18:01,030 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 169#L513 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 175#L517 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strcmp_#in~s1.base, strcmp_#in~s1.offset, strcmp_#in~s2.base, strcmp_#in~s2.offset := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset;havoc strcmp_#res;havoc strcmp_#t~post6.base, strcmp_#t~post6.offset, strcmp_#t~post7.base, strcmp_#t~post7.offset, strcmp_#t~mem4, strcmp_#t~mem2, strcmp_#t~mem3, strcmp_#t~short5, strcmp_#t~mem8, strcmp_#t~mem9, strcmp_~s1.base, strcmp_~s1.offset, strcmp_~s2.base, strcmp_~s2.offset;strcmp_~s1.base, strcmp_~s1.offset := strcmp_#in~s1.base, strcmp_#in~s1.offset;strcmp_~s2.base, strcmp_~s2.offset := strcmp_#in~s2.base, strcmp_#in~s2.offset; 178#L507-5 call strcmp_#t~mem4 := read~int(strcmp_~s1.base, strcmp_~s1.offset, 1);strcmp_#t~short5 := 0 != strcmp_#t~mem4; 176#L507-1 [2018-11-28 23:18:01,030 INFO L796 eck$LassoCheckResult]: Loop: 176#L507-1 assume !strcmp_#t~short5; 171#L507-3 assume !!strcmp_#t~short5;havoc strcmp_#t~mem2;havoc strcmp_#t~mem3;havoc strcmp_#t~mem4;havoc strcmp_#t~short5;strcmp_#t~post6.base, strcmp_#t~post6.offset := strcmp_~s1.base, strcmp_~s1.offset;strcmp_~s1.base, strcmp_~s1.offset := strcmp_#t~post6.base, 1 + strcmp_#t~post6.offset;havoc strcmp_#t~post6.base, strcmp_#t~post6.offset;strcmp_#t~post7.base, strcmp_#t~post7.offset := strcmp_~s2.base, strcmp_~s2.offset;strcmp_~s2.base, strcmp_~s2.offset := strcmp_#t~post7.base, 1 + strcmp_#t~post7.offset;havoc strcmp_#t~post7.base, strcmp_#t~post7.offset; 172#L507-5 call strcmp_#t~mem4 := read~int(strcmp_~s1.base, strcmp_~s1.offset, 1);strcmp_#t~short5 := 0 != strcmp_#t~mem4; 176#L507-1 [2018-11-28 23:18:01,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:01,030 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-11-28 23:18:01,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:01,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:01,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:01,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:01,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:01,071 INFO L82 PathProgramCache]: Analyzing trace with hash 51818, now seen corresponding path program 1 times [2018-11-28 23:18:01,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:01,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:01,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:01,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:18:01,109 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:18:01,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:18:01,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:18:01,113 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:18:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:01,141 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-11-28 23:18:01,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:18:01,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-28 23:18:01,142 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:01,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2018-11-28 23:18:01,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:18:01,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:18:01,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:18:01,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:01,143 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:01,143 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:01,143 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:01,143 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:18:01,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:18:01,144 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:01,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:18:01,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:18:01 BoogieIcfgContainer [2018-11-28 23:18:01,150 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:01,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:01,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:01,151 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:01,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:56" (3/4) ... [2018-11-28 23:18:01,154 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:18:01,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:01,156 INFO L168 Benchmark]: Toolchain (without parser) took 6166.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:01,157 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:01,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 578.23 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 927.2 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:01,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:01,159 INFO L168 Benchmark]: Boogie Preprocessor took 30.41 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. [2018-11-28 23:18:01,161 INFO L168 Benchmark]: RCFGBuilder took 476.20 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:01,162 INFO L168 Benchmark]: BuchiAutomizer took 4945.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:01,163 INFO L168 Benchmark]: Witness Printer took 4.07 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. [2018-11-28 23:18:01,169 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 578.23 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 927.2 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 126.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.41 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 476.20 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4945.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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 13 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 15 SDslu, 11 SDs, 0 SdLazy, 20 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp47 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...