./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-industry-pattern/array_single_elem_init_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-industry-pattern/array_single_elem_init_false-unreach-call_true-termination.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 5375af47d6130a7bd98a5147355b5bb76e636a73 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:49:49,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:49:49,847 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:49:49,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:49:49,865 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:49:49,867 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:49:49,869 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:49:49,872 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:49:49,873 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:49:49,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:49:49,878 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:49:49,879 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:49:49,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:49:49,883 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:49:49,891 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:49:49,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:49:49,895 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:49:49,899 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:49:49,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:49:49,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:49:49,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:49:49,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:49:49,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:49:49,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:49:49,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:49:49,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:49:49,917 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:49:49,918 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:49:49,920 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:49:49,922 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:49:49,924 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:49:49,925 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:49:49,926 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:49:49,927 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:49:49,928 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:49:49,928 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:49:49,929 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:49:49,950 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:49:49,951 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:49:49,952 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:49:49,952 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:49:49,952 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:49:49,952 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:49:49,953 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:49:49,953 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:49:49,954 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:49:49,954 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:49:49,954 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:49:49,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:49:49,954 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:49:49,954 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:49:49,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:49:49,956 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:49:49,956 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:49:49,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:49:49,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:49:49,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:49:49,956 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:49:49,957 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:49:49,957 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:49:49,958 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:49:49,958 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:49:49,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:49:49,958 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:49:49,958 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:49:49,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:49:49,959 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:49:49,960 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:49:49,961 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:49:49,961 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5375af47d6130a7bd98a5147355b5bb76e636a73 [2019-01-14 02:49:49,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:49:50,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:49:50,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:49:50,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:49:50,014 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:49:50,015 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-industry-pattern/array_single_elem_init_false-unreach-call_true-termination.i [2019-01-14 02:49:50,070 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f986e0bd4/250b818421c84d99ad923701c64ac49d/FLAG38622bc71 [2019-01-14 02:49:50,470 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:49:50,471 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-industry-pattern/array_single_elem_init_false-unreach-call_true-termination.i [2019-01-14 02:49:50,476 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f986e0bd4/250b818421c84d99ad923701c64ac49d/FLAG38622bc71 [2019-01-14 02:49:50,853 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f986e0bd4/250b818421c84d99ad923701c64ac49d [2019-01-14 02:49:50,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:49:50,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:49:50,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:49:50,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:49:50,863 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:49:50,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:49:50" (1/1) ... [2019-01-14 02:49:50,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5524172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:50, skipping insertion in model container [2019-01-14 02:49:50,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:49:50" (1/1) ... [2019-01-14 02:49:50,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:49:50,891 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:49:51,099 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:49:51,108 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:49:51,146 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:49:51,175 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:49:51,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:51 WrapperNode [2019-01-14 02:49:51,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:49:51,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:49:51,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:49:51,178 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:49:51,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:51" (1/1) ... [2019-01-14 02:49:51,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:51" (1/1) ... [2019-01-14 02:49:51,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:49:51,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:49:51,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:49:51,236 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:49:51,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:51" (1/1) ... [2019-01-14 02:49:51,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:51" (1/1) ... [2019-01-14 02:49:51,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:51" (1/1) ... [2019-01-14 02:49:51,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:51" (1/1) ... [2019-01-14 02:49:51,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:51" (1/1) ... [2019-01-14 02:49:51,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:51" (1/1) ... [2019-01-14 02:49:51,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:51" (1/1) ... [2019-01-14 02:49:51,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:49:51,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:49:51,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:49:51,295 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:49:51,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49: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 [2019-01-14 02:49:51,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:49:51,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:49:51,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:49:51,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:49:51,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:49:51,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:49:51,898 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:49:51,898 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:49:51,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:51 BoogieIcfgContainer [2019-01-14 02:49:51,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:49:51,900 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:49:51,900 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:49:51,904 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:49:51,905 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:51,905 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:49:50" (1/3) ... [2019-01-14 02:49:51,906 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a92982f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:49:51, skipping insertion in model container [2019-01-14 02:49:51,906 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:51,907 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:51" (2/3) ... [2019-01-14 02:49:51,907 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a92982f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:49:51, skipping insertion in model container [2019-01-14 02:49:51,907 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:51,907 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:51" (3/3) ... [2019-01-14 02:49:51,909 INFO L375 chiAutomizerObserver]: Analyzing ICFG array_single_elem_init_false-unreach-call_true-termination.i [2019-01-14 02:49:51,987 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:49:51,988 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:49:51,988 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:49:51,988 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:49:51,988 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:49:51,988 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:49:51,989 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:49:51,989 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:49:51,989 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:49:52,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-14 02:49:52,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-14 02:49:52,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:52,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:52,029 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:49:52,030 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:49:52,030 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:49:52,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-14 02:49:52,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-14 02:49:52,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:52,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:52,033 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:49:52,033 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:49:52,040 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 5#L10-3true [2019-01-14 02:49:52,040 INFO L796 eck$LassoCheckResult]: Loop: 5#L10-3true assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 21#L14true assume 0 == main_~q~0;call write~int(1, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~int((if main_~i~0 < 0 && 0 != main_~i~0 % 2 then main_~i~0 % 2 - 2 else main_~i~0 % 2), main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~0, 4); 16#L14-2true call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 9#L19true assume !(0 != main_#t~mem2);havoc main_#t~mem2; 8#L10-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 5#L10-3true [2019-01-14 02:49:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:49:52,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:52,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:52,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:52,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:52,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:52,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash 38268879, now seen corresponding path program 1 times [2019-01-14 02:49:52,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:52,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:52,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:52,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:52,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:52,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1809708365, now seen corresponding path program 1 times [2019-01-14 02:49:52,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:52,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:52,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:52,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:52,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:52,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:49:52,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:49:52,694 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-14 02:49:53,168 WARN L181 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-01-14 02:49:53,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:49:53,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:49:53,184 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2019-01-14 02:49:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:53,433 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-01-14 02:49:53,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:49:53,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2019-01-14 02:49:53,438 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-14 02:49:53,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2019-01-14 02:49:53,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:49:53,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 02:49:53,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-01-14 02:49:53,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:53,447 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-14 02:49:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-01-14 02:49:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-01-14 02:49:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:49:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-01-14 02:49:53,473 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-14 02:49:53,473 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-14 02:49:53,473 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:49:53,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-01-14 02:49:53,475 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-14 02:49:53,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:53,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:53,475 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:49:53,476 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:49:53,476 INFO L794 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 61#L10-3 [2019-01-14 02:49:53,476 INFO L796 eck$LassoCheckResult]: Loop: 61#L10-3 assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 62#L14 assume !(0 == main_~q~0); 71#L14-2 call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 72#L19 assume !(0 != main_#t~mem2);havoc main_#t~mem2; 64#L10-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 61#L10-3 [2019-01-14 02:49:53,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:53,477 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 02:49:53,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:53,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:53,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:53,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:53,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:53,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash 38328461, now seen corresponding path program 1 times [2019-01-14 02:49:53,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:53,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:53,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:53,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:49:53,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:53,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:53,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1809767947, now seen corresponding path program 1 times [2019-01-14 02:49:53,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:53,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:53,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:53,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:53,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:53,823 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-14 02:49:54,091 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-14 02:49:54,121 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:49:54,123 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:49:54,124 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:49:54,124 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:49:54,125 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:49:54,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:54,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:49:54,127 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:49:54,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init_false-unreach-call_true-termination.i_Iteration2_Lasso [2019-01-14 02:49:54,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:49:54,128 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:49:54,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:54,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:54,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:54,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:54,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:54,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:54,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:54,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:54,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:54,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:54,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:54,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:54,984 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-01-14 02:49:55,016 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:49:55,022 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:49:55,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:55,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:55,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:55,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:55,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:55,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:55,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:55,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:55,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:55,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:55,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:55,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,037 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:49:55,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,039 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:49:55,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:55,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:55,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:55,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:55,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:55,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:55,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:55,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:55,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:55,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:55,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:55,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:55,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:55,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:55,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:55,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:55,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:55,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:55,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:55,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:55,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:55,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:55,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:55,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:55,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:55,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:55,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:55,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:55,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:55,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:55,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:55,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:55,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:55,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:55,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:55,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:55,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:55,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:55,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:55,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:55,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:55,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:55,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:55,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:55,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:55,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:55,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:55,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:55,210 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:49:55,274 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:49:55,274 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:49:55,277 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:49:55,280 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:49:55,280 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:49:55,281 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2019-01-14 02:49:55,434 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-14 02:49:55,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:55,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:55,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:55,627 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:49:55,628 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:49:55,696 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 25 states and 36 transitions. Complement of second has 7 states. [2019-01-14 02:49:55,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:49:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:49:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 02:49:55,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 5 letters. [2019-01-14 02:49:55,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:55,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-14 02:49:55,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:55,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 10 letters. [2019-01-14 02:49:55,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:55,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2019-01-14 02:49:55,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:49:55,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 23 transitions. [2019-01-14 02:49:55,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:49:55,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:49:55,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-01-14 02:49:55,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:55,707 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 02:49:55,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-01-14 02:49:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 02:49:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 02:49:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-01-14 02:49:55,709 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 02:49:55,709 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 02:49:55,709 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:49:55,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-01-14 02:49:55,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:49:55,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:55,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:55,712 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:49:55,712 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:49:55,712 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 179#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~#c~0.base, main_~#c~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);call main_~#c~0.base, main_~#c~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 171#L10-3 assume !(main_~i~0 < 100000); 169#L10-4 call write~int(1, main_~#a~0.base, 60000 + main_~#a~0.offset, 4);main_~i~0 := 0; 170#L32-3 [2019-01-14 02:49:55,713 INFO L796 eck$LassoCheckResult]: Loop: 170#L32-3 assume !!(main_~i~0 < 100000); 174#L34 assume !(15000 == main_~i~0); 178#L32-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 170#L32-3 [2019-01-14 02:49:55,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:55,714 INFO L82 PathProgramCache]: Analyzing trace with hash 925725, now seen corresponding path program 1 times [2019-01-14 02:49:55,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:55,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:55,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:55,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:55,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:55,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:49:55,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:49:55,799 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:49:55,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash 71947, now seen corresponding path program 1 times [2019-01-14 02:49:55,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:55,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:55,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:55,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:55,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:56,002 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:49:56,002 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:49:56,003 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:49:56,003 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:49:56,003 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:49:56,003 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:56,003 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:49:56,003 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:49:56,003 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init_false-unreach-call_true-termination.i_Iteration3_Loop [2019-01-14 02:49:56,003 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:49:56,004 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:49:56,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:56,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:56,167 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:49:56,168 INFO L412 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 [2019-01-14 02:49:56,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:49:56,173 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:49:56,178 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:49:56,178 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=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 [2019-01-14 02:49:56,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:49:56,211 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) [2019-01-14 02:49:56,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:49:56,261 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:56,451 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:49:56,455 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:49:56,455 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:49:56,455 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:49:56,455 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:49:56,456 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:49:56,456 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:56,456 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:49:56,456 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:49:56,456 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_single_elem_init_false-unreach-call_true-termination.i_Iteration3_Loop [2019-01-14 02:49:56,456 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:49:56,456 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:49:56,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:56,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:56,601 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:49:56,603 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:49:56,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:56,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:56,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:56,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:56,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:56,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:56,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:56,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:56,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:56,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:56,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:56,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:56,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:56,611 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:49:56,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:56,612 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:49:56,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:56,618 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:49:56,621 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:49:56,621 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:49:56,622 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:49:56,622 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:49:56,622 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:49:56,622 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2019-01-14 02:49:56,623 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:49:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:56,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:56,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:56,896 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:49:56,897 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:49:57,023 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 22 states and 30 transitions. Complement of second has 4 states. [2019-01-14 02:49:57,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:49:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:49:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-01-14 02:49:57,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:49:57,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:57,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:49:57,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:57,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 02:49:57,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:57,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2019-01-14 02:49:57,033 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:57,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-01-14 02:49:57,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:49:57,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:49:57,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:49:57,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:57,034 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:57,035 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:57,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:49:57,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:49:57,037 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 02:49:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:57,037 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:49:57,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:49:57,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:49:57,039 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:57,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:49:57,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:49:57,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:49:57,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:49:57,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:57,041 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:57,041 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:57,041 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:57,041 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:49:57,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:49:57,041 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:57,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:49:57,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:49:57 BoogieIcfgContainer [2019-01-14 02:49:57,056 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:49:57,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:49:57,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:49:57,057 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:49:57,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:51" (3/4) ... [2019-01-14 02:49:57,065 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:49:57,065 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:49:57,066 INFO L168 Benchmark]: Toolchain (without parser) took 6209.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 952.7 MB in the beginning and 805.5 MB in the end (delta: 147.2 MB). Peak memory consumption was 252.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:57,069 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:57,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.87 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:57,073 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.47 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:57,074 INFO L168 Benchmark]: Boogie Preprocessor took 59.42 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:57,076 INFO L168 Benchmark]: RCFGBuilder took 604.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -137.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:57,079 INFO L168 Benchmark]: BuchiAutomizer took 5156.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 805.5 MB in the end (delta: 268.3 MB). Peak memory consumption was 268.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:57,081 INFO L168 Benchmark]: Witness Printer took 8.59 ms. Allocated memory is still 1.1 GB. Free memory is still 805.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:57,089 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.87 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 57.47 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.42 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 604.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -137.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5156.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 805.5 MB in the end (delta: 268.3 MB). Peak memory consumption was 268.3 MB. Max. memory is 11.5 GB. * Witness Printer took 8.59 ms. Allocated memory is still 1.1 GB. Free memory is still 805.5 MB. There was no memory consumed. 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 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 199999 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 199999 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 58 SDslu, 29 SDs, 0 SdLazy, 62 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital60 mio100 ax100 hnf100 lsp95 ukn85 mio100 lsp81 div100 bol100 ite100 ukn100 eq165 hnf94 smp100 dnf233 smp89 tf104 neg91 sie131 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 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...