./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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-crafted-lit/cstrcmp_true-termination_true-no-overflow.c -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 256a9ac0f321f0d2863fb720d2ae6cb61570c373 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:35:00,843 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:35:00,845 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:35:00,858 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:35:00,858 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:35:00,859 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:35:00,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:35:00,863 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:35:00,865 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:35:00,866 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:35:00,867 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:35:00,867 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:35:00,869 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:35:00,870 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:35:00,871 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:35:00,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:35:00,873 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:35:00,875 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:35:00,877 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:35:00,879 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:35:00,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:35:00,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:35:00,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:35:00,885 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:35:00,885 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:35:00,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:35:00,888 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:35:00,889 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:35:00,890 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:35:00,891 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:35:00,891 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:35:00,892 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:35:00,892 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:35:00,892 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:35:00,893 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:35:00,894 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:35:00,894 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:35:00,925 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:35:00,926 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:35:00,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:35:00,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:35:00,933 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:35:00,933 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:35:00,933 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:35:00,934 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:35:00,934 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:35:00,935 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:35:00,935 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:35:00,935 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:35:00,935 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:35:00,935 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:35:00,935 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:35:00,936 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:35:00,936 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:35:00,936 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:35:00,936 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:35:00,936 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:35:00,936 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:35:00,938 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:35:00,938 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:35:00,938 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:35:00,939 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:35:00,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:35:00,940 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:35:00,940 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:35:00,941 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:35:00,941 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 -> 256a9ac0f321f0d2863fb720d2ae6cb61570c373 [2019-01-01 21:35:00,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:35:00,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:35:00,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:35:01,000 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:35:01,001 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:35:01,001 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c [2019-01-01 21:35:01,073 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813abe757/2d71d1e8cdd4493bba3fa610b53fba4d/FLAGf9fb53e41 [2019-01-01 21:35:01,555 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:35:01,556 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/cstrcmp_true-termination_true-no-overflow.c [2019-01-01 21:35:01,563 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813abe757/2d71d1e8cdd4493bba3fa610b53fba4d/FLAGf9fb53e41 [2019-01-01 21:35:01,930 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813abe757/2d71d1e8cdd4493bba3fa610b53fba4d [2019-01-01 21:35:01,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:35:01,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:35:01,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:35:01,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:35:01,940 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:35:01,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:35:01" (1/1) ... [2019-01-01 21:35:01,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abb5e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:01, skipping insertion in model container [2019-01-01 21:35:01,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:35:01" (1/1) ... [2019-01-01 21:35:01,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:35:01,973 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:35:02,166 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:35:02,180 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:35:02,211 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:35:02,234 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:35:02,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02 WrapperNode [2019-01-01 21:35:02,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:35:02,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:35:02,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:35:02,237 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:35:02,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:35:02,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:35:02,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:35:02,296 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:35:02,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (1/1) ... [2019-01-01 21:35:02,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:35:02,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:35:02,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:35:02,351 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:35:02,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (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 [2019-01-01 21:35:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:35:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 21:35:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:35:02,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:35:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:35:03,005 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:35:03,006 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-01 21:35:03,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:35:03 BoogieIcfgContainer [2019-01-01 21:35:03,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:35:03,007 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:35:03,007 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:35:03,010 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:35:03,011 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:35:03,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:35:01" (1/3) ... [2019-01-01 21:35:03,013 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b1bd7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:35:03, skipping insertion in model container [2019-01-01 21:35:03,013 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:35:03,013 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:35:02" (2/3) ... [2019-01-01 21:35:03,014 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b1bd7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:35:03, skipping insertion in model container [2019-01-01 21:35:03,014 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:35:03,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:35:03" (3/3) ... [2019-01-01 21:35:03,016 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcmp_true-termination_true-no-overflow.c [2019-01-01 21:35:03,077 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:35:03,078 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:35:03,079 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:35:03,079 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:35:03,079 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:35:03,080 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:35:03,080 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:35:03,080 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:35:03,080 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:35:03,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:35:03,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:03,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:03,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:03,131 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:03,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:35:03,131 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:35:03,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:35:03,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:03,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:03,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:03,135 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:03,135 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:35:03,145 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_#t~ret13;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 20#L14true assume !(build_nondet_String_~length~0 < 1); 16#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 15#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 11#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 7#L19-1true main_#t~ret12.base, main_#t~ret12.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 5#L32-5true [2019-01-01 21:35:03,145 INFO L796 eck$LassoCheckResult]: Loop: 5#L32-5true call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 13#L32-1true assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 8#L32-3true assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 5#L32-5true [2019-01-01 21:35:03,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:03,152 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2019-01-01 21:35:03,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:03,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:03,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:03,329 INFO L82 PathProgramCache]: Analyzing trace with hash 54720, now seen corresponding path program 1 times [2019-01-01 21:35:03,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:03,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:03,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:03,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:03,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:03,363 INFO L82 PathProgramCache]: Analyzing trace with hash 64858327, now seen corresponding path program 1 times [2019-01-01 21:35:03,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:03,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:35:03,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:35:03,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 21:35:04,091 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-01 21:35:04,257 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 21:35:04,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:35:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:35:04,282 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2019-01-01 21:35:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:35:04,625 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-01-01 21:35:04,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:35:04,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2019-01-01 21:35:04,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:04,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 13 states and 14 transitions. [2019-01-01 21:35:04,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:35:04,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:35:04,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-01-01 21:35:04,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:35:04,638 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-01 21:35:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-01-01 21:35:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-01 21:35:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:35:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-01 21:35:04,671 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-01 21:35:04,671 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-01 21:35:04,671 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:35:04,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-01-01 21:35:04,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:35:04,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:35:04,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:35:04,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:35:04,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:35:04,674 INFO L794 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 75#L-1 havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_#t~ret13;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 76#L14 assume !(build_nondet_String_~length~0 < 1); 83#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 84#L19 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 80#L14-3 assume !(build_nondet_String_~length~0 < 1); 81#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 85#L19-1 main_#t~ret12.base, main_#t~ret12.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset, cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset, cstrcmp_#t~mem2, cstrcmp_#t~mem3, cstrcmp_#t~mem4, cstrcmp_#t~short5, cstrcmp_#t~mem8, cstrcmp_#t~mem9, cstrcmp_#t~ite10, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 82#L32-5 [2019-01-01 21:35:04,674 INFO L796 eck$LassoCheckResult]: Loop: 82#L32-5 call cstrcmp_#t~mem2 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short5 := 0 != cstrcmp_#t~mem2; 77#L32-1 assume cstrcmp_#t~short5;call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem4 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short5 := cstrcmp_#t~mem3 == cstrcmp_#t~mem4; 78#L32-3 assume !!cstrcmp_#t~short5;havoc cstrcmp_#t~mem2;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;havoc cstrcmp_#t~short5;cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post6.base, 1 + cstrcmp_#t~post6.offset;havoc cstrcmp_#t~post6.base, cstrcmp_#t~post6.offset;cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post7.base, 1 + cstrcmp_#t~post7.offset;havoc cstrcmp_#t~post7.base, cstrcmp_#t~post7.offset; 82#L32-5 [2019-01-01 21:35:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2019-01-01 21:35:04,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:04,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:04,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:04,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:04,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash 54720, now seen corresponding path program 2 times [2019-01-01 21:35:04,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:04,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:04,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:35:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:04,743 INFO L82 PathProgramCache]: Analyzing trace with hash 122116629, now seen corresponding path program 1 times [2019-01-01 21:35:04,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:35:04,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:35:04,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:04,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:35:04,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:35:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:35:05,293 WARN L181 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-01 21:35:05,865 WARN L181 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2019-01-01 21:35:06,075 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-01 21:35:06,096 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:35:06,097 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:35:06,097 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:35:06,097 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:35:06,097 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:35:06,097 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:35:06,098 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:35:06,098 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:35:06,098 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp_true-termination_true-no-overflow.c_Iteration2_Lasso [2019-01-01 21:35:06,098 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:35:06,098 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:35:06,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,703 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-01-01 21:35:06,851 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-01-01 21:35:06,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:06,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:35:07,688 WARN L181 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 21:35:07,964 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:35:07,972 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:35:07,975 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 [2019-01-01 21:35:07,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:07,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:07,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:07,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:07,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:07,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:07,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:07,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:07,989 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 [2019-01-01 21:35:07,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:07,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:07,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:07,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:07,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:07,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:07,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:07,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:07,992 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 [2019-01-01 21:35:07,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:07,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:07,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:07,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:07,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:07,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:07,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,000 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 [2019-01-01 21:35:08,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,002 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 [2019-01-01 21:35:08,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,005 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 [2019-01-01 21:35:08,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,008 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 [2019-01-01 21:35:08,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,011 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 [2019-01-01 21:35:08,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:08,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:08,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,017 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 [2019-01-01 21:35:08,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,020 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 [2019-01-01 21:35:08,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,023 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 [2019-01-01 21:35:08,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,026 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 [2019-01-01 21:35:08,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,028 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 [2019-01-01 21:35:08,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,032 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 [2019-01-01 21:35:08,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,037 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 [2019-01-01 21:35:08,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,042 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 [2019-01-01 21:35:08,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,049 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 [2019-01-01 21:35:08,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:35:08,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:35:08,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:35:08,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,053 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 [2019-01-01 21:35:08,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:08,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:08,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,065 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 [2019-01-01 21:35:08,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,066 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:35:08,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,091 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:35:08,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:08,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:35:08,145 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 [2019-01-01 21:35:08,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:35:08,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:35:08,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:35:08,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:35:08,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:35:08,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:35:08,210 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:35:08,296 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:35:08,296 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:35:08,300 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:35:08,302 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:35:08,302 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:35:08,303 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset, v_rep(select #length ULTIMATE.start_main_#t~ret11.base)_1) = -1*ULTIMATE.start_cstrcmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret11.base)_1 Supporting invariants [] [2019-01-01 21:35:08,492 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2019-01-01 21:35:08,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:35:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:35:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:08,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:35:08,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:35:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:35:08,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-01-01 21:35:08,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-01-01 21:35:08,783 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 14 states and 16 transitions. Complement of second has 7 states. [2019-01-01 21:35:08,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:35:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:35:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-01-01 21:35:08,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 21:35:08,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:08,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-01 21:35:08,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:08,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 21:35:08,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:35:08,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2019-01-01 21:35:08,790 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:35:08,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2019-01-01 21:35:08,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:35:08,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:35:08,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:35:08,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:35:08,791 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:35:08,791 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:35:08,791 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:35:08,792 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:35:08,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:35:08,792 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:35:08,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:35:08,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:35:08 BoogieIcfgContainer [2019-01-01 21:35:08,801 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:35:08,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:35:08,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:35:08,802 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:35:08,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:35:03" (3/4) ... [2019-01-01 21:35:08,807 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:35:08,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:35:08,808 INFO L168 Benchmark]: Toolchain (without parser) took 6873.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -74.0 MB). Peak memory consumption was 127.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:08,809 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:35:08,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.50 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:08,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.14 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:35:08,811 INFO L168 Benchmark]: Boogie Preprocessor took 50.95 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:08,812 INFO L168 Benchmark]: RCFGBuilder took 655.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:08,813 INFO L168 Benchmark]: BuchiAutomizer took 5794.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.3 MB). Peak memory consumption was 153.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:35:08,814 INFO L168 Benchmark]: Witness Printer took 5.09 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-01-01 21:35:08,820 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.61 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.50 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.14 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.95 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 655.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5794.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.3 MB). Peak memory consumption was 153.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.09 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 (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[build_nondet_String()] and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 38 SDslu, 92 SDs, 0 SdLazy, 76 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital216 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp47 div100 bol100 ite100 ukn100 eq198 hnf88 smp100 dnf174 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 79ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...