./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/large_const.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/loop-invgen/large_const.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 33c08254565cae69ff4d85e44f52f84d01577894 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 02:07:49,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 02:07:49,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 02:07:49,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 02:07:49,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 02:07:49,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 02:07:49,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 02:07:49,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 02:07:49,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 02:07:49,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 02:07:49,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 02:07:49,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 02:07:49,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 02:07:49,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 02:07:49,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 02:07:49,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 02:07:49,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 02:07:49,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 02:07:49,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 02:07:49,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 02:07:49,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 02:07:49,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 02:07:49,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 02:07:49,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 02:07:49,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 02:07:49,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 02:07:49,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 02:07:49,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 02:07:49,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 02:07:49,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 02:07:49,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 02:07:49,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 02:07:49,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 02:07:49,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 02:07:49,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 02:07:49,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 02:07:49,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 02:07:49,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 02:07:49,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 02:07:49,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 02:07:49,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 02:07:49,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 02:07:49,978 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 02:07:49,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 02:07:49,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 02:07:49,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 02:07:49,984 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 02:07:49,984 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 02:07:49,984 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 02:07:49,984 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 02:07:49,984 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 02:07:49,985 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 02:07:49,985 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 02:07:49,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 02:07:49,986 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 02:07:49,987 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 02:07:49,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 02:07:49,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 02:07:49,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 02:07:49,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 02:07:49,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 02:07:49,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 02:07:49,988 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 02:07:49,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 02:07:49,989 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 02:07:49,989 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 02:07:49,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 02:07:49,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 02:07:49,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 02:07:49,990 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 02:07:49,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 02:07:49,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 02:07:49,991 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 02:07:49,991 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 02:07:49,993 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 02:07:49,994 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33c08254565cae69ff4d85e44f52f84d01577894 [2020-07-29 02:07:50,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 02:07:50,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 02:07:50,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 02:07:50,319 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 02:07:50,320 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 02:07:50,321 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/large_const.i [2020-07-29 02:07:50,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3511d1cb/b26aafe294444274a6bbd4bf159473fc/FLAG82f3b6d38 [2020-07-29 02:07:50,908 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 02:07:50,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/large_const.i [2020-07-29 02:07:50,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3511d1cb/b26aafe294444274a6bbd4bf159473fc/FLAG82f3b6d38 [2020-07-29 02:07:51,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3511d1cb/b26aafe294444274a6bbd4bf159473fc [2020-07-29 02:07:51,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 02:07:51,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 02:07:51,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 02:07:51,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 02:07:51,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 02:07:51,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:07:51" (1/1) ... [2020-07-29 02:07:51,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f015fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51, skipping insertion in model container [2020-07-29 02:07:51,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:07:51" (1/1) ... [2020-07-29 02:07:51,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 02:07:51,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 02:07:51,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:07:51,609 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 02:07:51,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:07:51,663 INFO L208 MainTranslator]: Completed translation [2020-07-29 02:07:51,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51 WrapperNode [2020-07-29 02:07:51,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 02:07:51,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 02:07:51,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 02:07:51,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 02:07:51,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51" (1/1) ... [2020-07-29 02:07:51,686 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51" (1/1) ... [2020-07-29 02:07:51,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 02:07:51,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 02:07:51,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 02:07:51,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 02:07:51,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51" (1/1) ... [2020-07-29 02:07:51,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51" (1/1) ... [2020-07-29 02:07:51,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51" (1/1) ... [2020-07-29 02:07:51,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51" (1/1) ... [2020-07-29 02:07:51,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51" (1/1) ... [2020-07-29 02:07:51,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51" (1/1) ... [2020-07-29 02:07:51,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51" (1/1) ... [2020-07-29 02:07:51,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 02:07:51,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 02:07:51,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 02:07:51,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 02:07:51,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51" (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 [2020-07-29 02:07:51,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 02:07:51,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 02:07:52,190 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 02:07:52,191 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 02:07:52,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:07:52 BoogieIcfgContainer [2020-07-29 02:07:52,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 02:07:52,197 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 02:07:52,197 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 02:07:52,203 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 02:07:52,204 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:07:52,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 02:07:51" (1/3) ... [2020-07-29 02:07:52,206 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2698bb47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:07:52, skipping insertion in model container [2020-07-29 02:07:52,206 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:07:52,206 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:51" (2/3) ... [2020-07-29 02:07:52,207 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2698bb47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:07:52, skipping insertion in model container [2020-07-29 02:07:52,207 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:07:52,207 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:07:52" (3/3) ... [2020-07-29 02:07:52,209 INFO L371 chiAutomizerObserver]: Analyzing ICFG large_const.i [2020-07-29 02:07:52,284 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 02:07:52,284 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 02:07:52,285 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 02:07:52,285 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 02:07:52,285 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 02:07:52,285 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 02:07:52,285 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 02:07:52,285 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 02:07:52,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 02:07:52,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 02:07:52,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:52,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:52,337 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 02:07:52,338 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:07:52,338 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 02:07:52,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 02:07:52,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 02:07:52,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:52,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:52,344 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 02:07:52,344 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:07:52,353 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_~argc, main_~argv.base, main_~argv.offset, main_~c1~0, main_~c2~0, main_~c3~0, main_~n~0, main_~v~0, main_~i~0, main_~k~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;main_~c1~0 := 4000;main_~c2~0 := 2000;main_~c3~0 := 10000;havoc main_~n~0;havoc main_~v~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 11#L20true assume !!(0 <= main_~n~0 && main_~n~0 < 10);main_~k~0 := 0;main_~i~0 := 0; 5#L29-2true [2020-07-29 02:07:52,354 INFO L796 eck$LassoCheckResult]: Loop: 5#L29-2true assume !!(main_~i~0 < main_~n~0);main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1;main_~v~0 := main_#t~nondet2;havoc main_#t~nondet2; 3#L26true assume !!(0 <= main_~v~0 && main_~n~0 < 2); 6#L27true assume 0 == main_~v~0;main_~k~0 := main_~k~0 + main_~c1~0; 5#L29-2true [2020-07-29 02:07:52,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:52,361 INFO L82 PathProgramCache]: Analyzing trace with hash 998, now seen corresponding path program 1 times [2020-07-29 02:07:52,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:52,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390501762] [2020-07-29 02:07:52,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:52,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:52,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:52,491 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:52,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:52,493 INFO L82 PathProgramCache]: Analyzing trace with hash 44849, now seen corresponding path program 1 times [2020-07-29 02:07:52,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:52,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871493603] [2020-07-29 02:07:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:52,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:52,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:52,514 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:52,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash 29746476, now seen corresponding path program 1 times [2020-07-29 02:07:52,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:52,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060797512] [2020-07-29 02:07:52,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:52,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:52,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:52,544 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:52,748 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2020-07-29 02:07:52,817 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:52,818 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:52,818 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:52,818 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:52,818 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:07:52,819 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:52,819 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:52,819 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:52,819 INFO L133 ssoRankerPreferences]: Filename of dumped script: large_const.i_Iteration1_Loop [2020-07-29 02:07:52,819 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:52,819 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:52,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:52,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:52,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:52,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:53,094 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:53,095 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:53,103 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:53,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:07:53,114 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:07:53,114 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=0, ULTIMATE.start_main_~c1~0=0} Honda state: {ULTIMATE.start_main_~k~0=0, ULTIMATE.start_main_~c1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:53,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:53,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:07:53,144 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:07:53,144 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~v~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_~v~0=0, ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:53,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:53,170 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:07:53,174 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:07:53,174 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1=0} Honda state: {ULTIMATE.start_main_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:53,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:53,201 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:53,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:07:53,245 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:53,359 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:07:53,364 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:53,364 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:53,365 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:53,365 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:53,365 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:07:53,366 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:53,366 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:53,366 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:53,366 INFO L133 ssoRankerPreferences]: Filename of dumped script: large_const.i_Iteration1_Loop [2020-07-29 02:07:53,366 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:53,367 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:53,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:53,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:53,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:53,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:53,576 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:53,582 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:53,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:07:53,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:07:53,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:07:53,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:07:53,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:07:53,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:07:53,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:07:53,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:07:53,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:53,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:53,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:07:53,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:07:53,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:07:53,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:07:53,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:07:53,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:07:53,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:07:53,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:53,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:07:53,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:07:53,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:07:53,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:07:53,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:07:53,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:53,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:07:53,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:07:53,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:53,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:07:53,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:07:53,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:07:53,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:07:53,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:07:53,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:07:53,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:07:53,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:53,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:07:53,776 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:07:53,776 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:53,782 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:07:53,783 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:07:53,783 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:07:53,784 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:53,829 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:07:53,834 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1;main_~v~0 := main_#t~nondet2;havoc main_#t~nondet2;" "assume !!(0 <= main_~v~0 && main_~n~0 < 2);" "assume 0 == main_~v~0;main_~k~0 := main_~k~0 + main_~c1~0;" [2020-07-29 02:07:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:53,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:53,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:07:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:53,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:53,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#unseeded} main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_~argc, main_~argv.base, main_~argv.offset, main_~c1~0, main_~c2~0, main_~c3~0, main_~n~0, main_~v~0, main_~i~0, main_~k~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;main_~c1~0 := 4000;main_~c2~0 := 2000;main_~c3~0 := 10000;havoc main_~n~0;havoc main_~v~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {25#unseeded} is VALID [2020-07-29 02:07:53,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#unseeded} assume !!(0 <= main_~n~0 && main_~n~0 < 10);main_~k~0 := 0;main_~i~0 := 0; {25#unseeded} is VALID [2020-07-29 02:07:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:53,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 02:07:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:53,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:54,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 1))} assume !!(main_~i~0 < main_~n~0);main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1;main_~v~0 := main_#t~nondet2;havoc main_#t~nondet2; {46#(and (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~i~0) (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:07:54,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(and (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~i~0) (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~n~0))} assume !!(0 <= main_~v~0 && main_~n~0 < 2); {50#(and (<= (div (+ oldRank0 (- 1)) (- 2)) 0) (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 02:07:54,122 INFO L280 TraceCheckUtils]: 2: Hoare triple {50#(and (<= (div (+ oldRank0 (- 1)) (- 2)) 0) (<= (+ (div (+ oldRank0 (- 1)) (- 2)) 1) ULTIMATE.start_main_~i~0))} assume 0 == main_~v~0;main_~k~0 := main_~k~0 + main_~c1~0; {38#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 1))) unseeded)} is VALID [2020-07-29 02:07:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:54,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:07:54,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:07:54,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:07:54,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,159 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 02:07:54,161 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2020-07-29 02:07:54,311 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 49 states and 65 transitions. Complement of second has 7 states. [2020-07-29 02:07:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:07:54,311 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:54,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 02:07:54,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 02:07:54,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:54,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:54,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 02:07:54,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 02:07:54,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:54,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:54,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 65 transitions. [2020-07-29 02:07:54,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:07:54,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:54,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:54,330 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states. [2020-07-29 02:07:54,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 02:07:54,337 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 02:07:54,337 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 02:07:54,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 02:07:54,351 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:07:54,351 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 65 transitions. cyclomatic complexity: 20 [2020-07-29 02:07:54,352 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:07:54,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:07:54,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:07:54,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:07:54,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:54,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:54,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:54,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:54,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:54,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:54,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 02:07:54,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 02:07:54,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 49 letters. Loop has 49 letters. [2020-07-29 02:07:54,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:07:54,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:07:54,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:07:54,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:07:54,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:07:54,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:07:54,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:54,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:54,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:54,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:54,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:54,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:54,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:54,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:54,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:54,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:54,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:54,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:54,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:07:54,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:07:54,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:07:54,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:07:54,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:07:54,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:07:54,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:54,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:54,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:54,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:07:54,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:07:54,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:07:54,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:54,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:54,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:54,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:54,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:54,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:54,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:54,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:54,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:54,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:54,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:54,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:54,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:54,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:54,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 65 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:54,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,408 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 02:07:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-29 02:07:54,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:07:54,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:54,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-29 02:07:54,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:54,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 65 transitions. cyclomatic complexity: 20 [2020-07-29 02:07:54,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:07:54,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 15 states and 21 transitions. [2020-07-29 02:07:54,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 02:07:54,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 02:07:54,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2020-07-29 02:07:54,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:07:54,431 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-07-29 02:07:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2020-07-29 02:07:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-07-29 02:07:54,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:07:54,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 21 transitions. Second operand 13 states. [2020-07-29 02:07:54,464 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 21 transitions. Second operand 13 states. [2020-07-29 02:07:54,467 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand 13 states. [2020-07-29 02:07:54,471 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:07:54,475 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2020-07-29 02:07:54,476 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2020-07-29 02:07:54,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:54,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:54,477 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 15 states and 21 transitions. [2020-07-29 02:07:54,477 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 15 states and 21 transitions. [2020-07-29 02:07:54,478 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:07:54,480 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 02:07:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 02:07:54,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:54,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:54,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:07:54,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:07:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 02:07:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-07-29 02:07:54,485 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 02:07:54,485 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 02:07:54,486 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 02:07:54,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2020-07-29 02:07:54,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:07:54,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:54,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:54,487 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 02:07:54,488 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:07:54,488 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_~argc, main_~argv.base, main_~argv.offset, main_~c1~0, main_~c2~0, main_~c3~0, main_~n~0, main_~v~0, main_~i~0, main_~k~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;main_~c1~0 := 4000;main_~c2~0 := 2000;main_~c3~0 := 10000;havoc main_~n~0;havoc main_~v~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 119#L20 assume !!(0 <= main_~n~0 && main_~n~0 < 10);main_~k~0 := 0;main_~i~0 := 0; 125#L29-2 assume !(main_~i~0 < main_~n~0); 115#L23-2 main_~j~0 := 0; 116#L35-2 [2020-07-29 02:07:54,488 INFO L796 eck$LassoCheckResult]: Loop: 116#L35-2 assume !!(main_~j~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 > 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 124#L7 assume !(0 == __VERIFIER_assert_~cond); 117#L7-2 main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3;main_#t~post4 := main_~k~0;main_~k~0 := main_#t~post4 - 1;havoc main_#t~post4; 116#L35-2 [2020-07-29 02:07:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:54,489 INFO L82 PathProgramCache]: Analyzing trace with hash 959516, now seen corresponding path program 1 times [2020-07-29 02:07:54,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:54,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127588428] [2020-07-29 02:07:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:54,497 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:54,504 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:54,507 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:54,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:54,508 INFO L82 PathProgramCache]: Analyzing trace with hash 73710, now seen corresponding path program 1 times [2020-07-29 02:07:54,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:54,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775172449] [2020-07-29 02:07:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:54,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:54,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:54,541 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:54,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:54,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1479785997, now seen corresponding path program 1 times [2020-07-29 02:07:54,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:54,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85306089] [2020-07-29 02:07:54,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:54,651 INFO L280 TraceCheckUtils]: 0: Hoare triple {208#true} main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_~argc, main_~argv.base, main_~argv.offset, main_~c1~0, main_~c2~0, main_~c3~0, main_~n~0, main_~v~0, main_~i~0, main_~k~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;main_~c1~0 := 4000;main_~c2~0 := 2000;main_~c3~0 := 10000;havoc main_~n~0;havoc main_~v~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {208#true} is VALID [2020-07-29 02:07:54,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {208#true} assume !!(0 <= main_~n~0 && main_~n~0 < 10);main_~k~0 := 0;main_~i~0 := 0; {210#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 02:07:54,653 INFO L280 TraceCheckUtils]: 2: Hoare triple {210#(<= ULTIMATE.start_main_~i~0 0)} assume !(main_~i~0 < main_~n~0); {211#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 02:07:54,654 INFO L280 TraceCheckUtils]: 3: Hoare triple {211#(<= ULTIMATE.start_main_~n~0 0)} main_~j~0 := 0; {212#(<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 02:07:54,655 INFO L280 TraceCheckUtils]: 4: Hoare triple {212#(<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 > 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {209#false} is VALID [2020-07-29 02:07:54,655 INFO L280 TraceCheckUtils]: 5: Hoare triple {209#false} assume !(0 == __VERIFIER_assert_~cond); {209#false} is VALID [2020-07-29 02:07:54,656 INFO L280 TraceCheckUtils]: 6: Hoare triple {209#false} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3;main_#t~post4 := main_~k~0;main_~k~0 := main_#t~post4 - 1;havoc main_#t~post4; {209#false} is VALID [2020-07-29 02:07:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:54,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85306089] [2020-07-29 02:07:54,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:07:54,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 02:07:54,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591285929] [2020-07-29 02:07:54,737 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:54,737 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:54,737 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:54,737 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:54,737 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:07:54,738 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:54,738 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:54,738 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:54,738 INFO L133 ssoRankerPreferences]: Filename of dumped script: large_const.i_Iteration2_Loop [2020-07-29 02:07:54,738 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:54,738 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:54,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:54,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:54,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:54,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:54,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:54,895 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:54,896 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:54,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:54,907 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:54,912 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:07:54,912 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:54,954 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:54,955 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:54,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:07:54,984 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:07:55,023 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:07:55,025 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:55,025 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:55,026 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:55,026 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:55,026 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:07:55,026 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:55,026 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:55,026 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:55,026 INFO L133 ssoRankerPreferences]: Filename of dumped script: large_const.i_Iteration2_Loop [2020-07-29 02:07:55,027 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:55,027 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:55,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:55,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:55,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:55,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:55,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:55,249 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:55,249 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:55,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:07:55,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:07:55,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:07:55,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:07:55,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:07:55,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:07:55,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:07:55,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:07:55,257 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:07:55,264 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:07:55,264 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:55,270 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:07:55,270 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:07:55,270 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:07:55,271 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0) = 1*ULTIMATE.start_main_~k~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:55,299 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:07:55,302 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 > 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;" "assume !(0 == __VERIFIER_assert_~cond);" "main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3;main_#t~post4 := main_~k~0;main_~k~0 := main_#t~post4 - 1;havoc main_#t~post4;" [2020-07-29 02:07:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:55,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:55,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:07:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:55,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:55,338 INFO L280 TraceCheckUtils]: 0: Hoare triple {213#unseeded} main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_~argc, main_~argv.base, main_~argv.offset, main_~c1~0, main_~c2~0, main_~c3~0, main_~n~0, main_~v~0, main_~i~0, main_~k~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;main_~c1~0 := 4000;main_~c2~0 := 2000;main_~c3~0 := 10000;havoc main_~n~0;havoc main_~v~0;havoc main_~i~0;havoc main_~k~0;havoc main_~j~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {213#unseeded} is VALID [2020-07-29 02:07:55,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {213#unseeded} assume !!(0 <= main_~n~0 && main_~n~0 < 10);main_~k~0 := 0;main_~i~0 := 0; {213#unseeded} is VALID [2020-07-29 02:07:55,339 INFO L280 TraceCheckUtils]: 2: Hoare triple {213#unseeded} assume !(main_~i~0 < main_~n~0); {213#unseeded} is VALID [2020-07-29 02:07:55,340 INFO L280 TraceCheckUtils]: 3: Hoare triple {213#unseeded} main_~j~0 := 0; {213#unseeded} is VALID [2020-07-29 02:07:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:55,345 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 02:07:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:55,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:55,406 INFO L342 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-07-29 02:07:55,407 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 02:07:55,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {216#(>= oldRank0 ULTIMATE.start_main_~k~0)} assume !!(main_~j~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 > 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {240#(and (or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~k~0 0)) (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 oldRank0))} is VALID [2020-07-29 02:07:55,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#(and (or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~k~0 0)) (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 oldRank0))} assume !(0 == __VERIFIER_assert_~cond); {244#(and (< 0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 oldRank0))} is VALID [2020-07-29 02:07:55,425 INFO L280 TraceCheckUtils]: 2: Hoare triple {244#(and (< 0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 oldRank0))} main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3;main_#t~post4 := main_~k~0;main_~k~0 := main_#t~post4 - 1;havoc main_#t~post4; {226#(or (and (> oldRank0 ULTIMATE.start_main_~k~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:07:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:55,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:07:55,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:07:55,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:55,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,437 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 02:07:55,437 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 02:07:55,507 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 16 states and 23 transitions. Complement of second has 6 states. [2020-07-29 02:07:55,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:07:55,508 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:55,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. cyclomatic complexity: 8 [2020-07-29 02:07:55,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:55,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:55,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 02:07:55,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:07:55,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:55,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:55,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2020-07-29 02:07:55,510 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:07:55,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:07:55,511 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 19 transitions. cyclomatic complexity: 8 [2020-07-29 02:07:55,511 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:07:55,512 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 02:07:55,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:07:55,513 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:07:55,513 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 23 transitions. cyclomatic complexity: 9 [2020-07-29 02:07:55,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. cyclomatic complexity: 9 [2020-07-29 02:07:55,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:07:55,513 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 02:07:55,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:55,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:55,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:55,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:07:55,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:07:55,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:07:55,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2020-07-29 02:07:55,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 02:07:55,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2020-07-29 02:07:55,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2020-07-29 02:07:55,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 02:07:55,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2020-07-29 02:07:55,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:07:55,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:07:55,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:07:55,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:55,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:55,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:55,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:55,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:55,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:55,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:55,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:55,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:55,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:07:55,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:07:55,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:07:55,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,521 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 02:07:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 02:07:55,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:55,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:55,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 02:07:55,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:55,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. cyclomatic complexity: 9 [2020-07-29 02:07:55,525 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:07:55,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-07-29 02:07:55,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:07:55,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:07:55,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:07:55,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:07:55,526 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:07:55,526 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:07:55,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:07:55,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 02:07:55,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 02:07:55,529 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2020-07-29 02:07:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:07:55,530 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 02:07:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 02:07:55,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 02:07:55,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:07:55,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 02:07:55,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:07:55,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 02:07:55,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:07:55,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:07:55,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:07:55,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:07:55,541 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:07:55,541 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:07:55,542 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:07:55,542 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 02:07:55,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 02:07:55,542 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:07:55,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:07:55,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 02:07:55 BoogieIcfgContainer [2020-07-29 02:07:55,549 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 02:07:55,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 02:07:55,550 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 02:07:55,550 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 02:07:55,551 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:07:52" (3/4) ... [2020-07-29 02:07:55,554 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 02:07:55,555 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 02:07:55,557 INFO L168 Benchmark]: Toolchain (without parser) took 4268.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 958.9 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2020-07-29 02:07:55,558 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:07:55,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.01 ms. Allocated memory is still 1.0 GB. Free memory was 958.9 MB in the beginning and 948.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:07:55,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 02:07:55,560 INFO L168 Benchmark]: Boogie Preprocessor took 46.35 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. [2020-07-29 02:07:55,561 INFO L168 Benchmark]: RCFGBuilder took 357.97 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2020-07-29 02:07:55,562 INFO L168 Benchmark]: BuchiAutomizer took 3352.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.2 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2020-07-29 02:07:55,563 INFO L168 Benchmark]: Witness Printer took 5.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 02:07:55,567 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.01 ms. Allocated memory is still 1.0 GB. Free memory was 958.9 MB in the beginning and 948.1 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 122.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.35 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 357.97 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3352.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.2 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function k and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. 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 13 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 37 SDslu, 24 SDs, 0 SdLazy, 16 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf100 lsp47 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf94 smp100 dnf100 smp100 tf112 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...