./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-memsafety/array01-alloca_true-valid-memsafety_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 9a031a295ba45c7116aee95a6abc238e63986cbf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:10:35,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:10:35,053 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:10:35,066 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:10:35,066 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:10:35,067 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:10:35,069 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:10:35,071 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:10:35,073 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:10:35,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:10:35,075 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:10:35,075 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:10:35,076 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:10:35,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:10:35,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:10:35,079 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:10:35,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:10:35,083 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:10:35,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:10:35,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:10:35,088 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:10:35,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:10:35,091 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:10:35,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:10:35,092 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:10:35,093 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:10:35,094 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:10:35,094 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:10:35,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:10:35,097 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:10:35,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:10:35,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:10:35,098 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:10:35,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:10:35,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:10:35,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:10:35,101 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:10:35,118 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:10:35,118 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:10:35,119 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:10:35,120 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:10:35,120 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:10:35,120 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:10:35,121 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:10:35,121 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:10:35,121 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:10:35,121 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:10:35,121 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:10:35,121 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:10:35,122 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:10:35,122 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:10:35,122 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:10:35,122 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:10:35,122 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:10:35,122 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:10:35,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:10:35,124 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:10:35,125 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:10:35,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:10:35,125 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:10:35,125 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:10:35,125 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:10:35,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:10:35,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:10:35,127 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:10:35,127 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:10:35,127 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:10:35,127 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:10:35,129 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:10:35,129 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 -> 9a031a295ba45c7116aee95a6abc238e63986cbf [2018-11-29 00:10:35,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:10:35,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:10:35,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:10:35,208 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:10:35,208 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:10:35,209 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:10:35,268 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab27dd32b/70fe29c4dcd64c0f8cf6eb03c4ec96a9/FLAGc65ac498f [2018-11-29 00:10:35,809 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:10:35,810 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:10:35,823 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab27dd32b/70fe29c4dcd64c0f8cf6eb03c4ec96a9/FLAGc65ac498f [2018-11-29 00:10:36,084 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab27dd32b/70fe29c4dcd64c0f8cf6eb03c4ec96a9 [2018-11-29 00:10:36,087 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:10:36,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:10:36,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:36,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:10:36,095 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:10:36,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:36" (1/1) ... [2018-11-29 00:10:36,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c029a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36, skipping insertion in model container [2018-11-29 00:10:36,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:36" (1/1) ... [2018-11-29 00:10:36,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:10:36,168 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:10:36,560 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:36,574 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:10:36,616 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:36,682 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:10:36,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36 WrapperNode [2018-11-29 00:10:36,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:36,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:36,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:10:36,685 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:10:36,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36" (1/1) ... [2018-11-29 00:10:36,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36" (1/1) ... [2018-11-29 00:10:36,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:36,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:10:36,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:10:36,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:10:36,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36" (1/1) ... [2018-11-29 00:10:36,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36" (1/1) ... [2018-11-29 00:10:36,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36" (1/1) ... [2018-11-29 00:10:36,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36" (1/1) ... [2018-11-29 00:10:36,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36" (1/1) ... [2018-11-29 00:10:36,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36" (1/1) ... [2018-11-29 00:10:36,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36" (1/1) ... [2018-11-29 00:10:36,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:10:36,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:10:36,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:10:36,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:10:36,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:10:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:10:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:10:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:10:36,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:10:36,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:10:37,249 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:10:37,250 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-29 00:10:37,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:37 BoogieIcfgContainer [2018-11-29 00:10:37,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:10:37,252 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:10:37,252 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:10:37,257 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:10:37,258 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:37,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:10:36" (1/3) ... [2018-11-29 00:10:37,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b256e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:37, skipping insertion in model container [2018-11-29 00:10:37,260 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:37,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:36" (2/3) ... [2018-11-29 00:10:37,261 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b256e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:37, skipping insertion in model container [2018-11-29 00:10:37,262 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:37,262 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:37" (3/3) ... [2018-11-29 00:10:37,264 INFO L375 chiAutomizerObserver]: Analyzing ICFG array01-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:10:37,335 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:10:37,336 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:10:37,336 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:10:37,336 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:10:37,337 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:10:37,337 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:10:37,337 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:10:37,337 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:10:37,338 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:10:37,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-29 00:10:37,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:10:37,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:37,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:37,382 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:37,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:37,383 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:10:37,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-29 00:10:37,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:10:37,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:37,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:37,386 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:37,386 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:10:37,396 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 4#L554true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9#L554-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 11#L544-3true [2018-11-29 00:10:37,396 INFO L796 eck$LassoCheckResult]: Loop: 11#L544-3true assume !!(test_fun_~i~0 < test_fun_~N); 6#L545-3true assume !true; 7#L544-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 11#L544-3true [2018-11-29 00:10:37,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:37,403 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-29 00:10:37,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:37,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:37,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:37,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:37,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:37,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:37,522 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2018-11-29 00:10:37,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:37,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:37,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:37,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:37,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:37,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:37,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:10:37,558 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:10:37,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-29 00:10:37,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-29 00:10:37,579 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-11-29 00:10:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:37,586 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-11-29 00:10:37,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:10:37,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-11-29 00:10:37,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:10:37,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2018-11-29 00:10:37,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-29 00:10:37,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-29 00:10:37,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-11-29 00:10:37,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:37,597 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-29 00:10:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-11-29 00:10:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-11-29 00:10:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-29 00:10:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-29 00:10:37,627 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-29 00:10:37,627 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-29 00:10:37,627 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:10:37,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-29 00:10:37,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-29 00:10:37,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:37,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:37,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:37,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:37,630 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L554-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 39#L544-3 [2018-11-29 00:10:37,630 INFO L796 eck$LassoCheckResult]: Loop: 39#L544-3 assume !!(test_fun_~i~0 < test_fun_~N); 36#L545-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 37#L545-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 38#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 39#L544-3 [2018-11-29 00:10:37,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-29 00:10:37,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:37,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:37,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:37,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:37,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:37,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:37,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2018-11-29 00:10:37,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:37,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:37,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:37,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:37,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:37,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2018-11-29 00:10:37,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:37,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:37,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:37,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:37,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:38,005 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-29 00:10:38,341 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-29 00:10:38,542 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-29 00:10:38,572 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:38,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:38,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:38,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:38,574 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:38,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:38,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:38,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:38,575 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-29 00:10:38,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:38,576 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:38,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:38,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:38,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:38,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:38,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:38,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:38,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:38,925 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-29 00:10:39,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:39,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:39,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:39,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:39,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:39,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:39,891 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:39,897 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:39,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:39,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:39,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:39,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:39,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:39,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:39,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:39,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:39,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:39,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:39,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:39,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:39,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:39,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:39,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:39,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:39,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:39,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:39,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:39,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:39,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:39,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:39,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:39,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:39,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:39,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:39,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:39,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:39,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:39,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:39,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:39,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:39,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:39,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:39,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:39,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:39,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:39,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:39,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:39,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:39,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:39,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:39,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:39,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:39,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:39,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:39,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:39,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:39,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:39,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:39,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:39,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:39,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:39,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:39,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:39,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:39,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:39,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:39,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:40,056 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:40,142 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:10:40,143 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-29 00:10:40,148 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:40,153 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:40,153 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:40,154 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-29 00:10:40,224 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-29 00:10:40,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:40,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:40,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:40,371 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 [2018-11-29 00:10:40,372 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-29 00:10:40,413 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2018-11-29 00:10:40,414 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 [2018-11-29 00:10:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-29 00:10:40,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-29 00:10:40,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:40,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-29 00:10:40,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:40,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-29 00:10:40,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:40,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-11-29 00:10:40,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:40,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-11-29 00:10:40,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-29 00:10:40,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-29 00:10:40,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-29 00:10:40,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:40,424 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-29 00:10:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-29 00:10:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-29 00:10:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-29 00:10:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-29 00:10:40,426 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-29 00:10:40,426 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-29 00:10:40,426 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:10:40,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-29 00:10:40,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:40,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:40,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:40,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:10:40,428 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:40,428 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 111#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 112#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 120#L554-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 121#L544-3 assume !!(test_fun_~i~0 < test_fun_~N); 113#L545-3 [2018-11-29 00:10:40,428 INFO L796 eck$LassoCheckResult]: Loop: 113#L545-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 114#L545-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 113#L545-3 [2018-11-29 00:10:40,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:40,429 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-29 00:10:40,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:40,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:40,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:40,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:40,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:40,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:40,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-11-29 00:10:40,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:40,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:40,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:40,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:40,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:40,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:40,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-29 00:10:40,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:40,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:40,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:40,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:40,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:40,590 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-29 00:10:40,948 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-11-29 00:10:41,049 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:41,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:41,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:41,050 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:41,050 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:41,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:41,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:41,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:41,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-29 00:10:41,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:41,050 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:41,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:41,306 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-29 00:10:41,632 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:41,633 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:41,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:41,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:41,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:41,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:41,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:41,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:41,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:41,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:41,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:41,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:41,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:41,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:41,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:41,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:41,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:41,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:41,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:41,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:41,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:41,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:41,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:41,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:41,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:41,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:41,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:41,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:41,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:41,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:41,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:41,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:41,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:41,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:41,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:41,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:41,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:41,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:41,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:41,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:41,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:41,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,784 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:41,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,790 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:41,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:41,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:41,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:41,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:41,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:41,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:41,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:41,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:41,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:41,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:41,829 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:41,830 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:41,831 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:10:41,831 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:41,831 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:10:41,835 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:41,835 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-29 00:10:41,878 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-29 00:10:41,881 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-29 00:10:41,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:41,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:41,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:42,057 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 [2018-11-29 00:10:42,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-29 00:10:42,090 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 7 states. [2018-11-29 00:10:42,092 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 [2018-11-29 00:10:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-29 00:10:42,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-29 00:10:42,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:42,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-29 00:10:42,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:42,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-29 00:10:42,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:42,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-11-29 00:10:42,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:42,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2018-11-29 00:10:42,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-29 00:10:42,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-29 00:10:42,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-29 00:10:42,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:42,099 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-29 00:10:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-29 00:10:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-29 00:10:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-29 00:10:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-29 00:10:42,101 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-29 00:10:42,101 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-29 00:10:42,101 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:10:42,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-29 00:10:42,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:42,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:42,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:42,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:42,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:42,106 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 200#L554 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 208#L554-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 209#L544-3 assume !!(test_fun_~i~0 < test_fun_~N); 210#L545-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 212#L545-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 205#L544-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 206#L544-3 assume !!(test_fun_~i~0 < test_fun_~N); 201#L545-3 [2018-11-29 00:10:42,106 INFO L796 eck$LassoCheckResult]: Loop: 201#L545-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 202#L545-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 201#L545-3 [2018-11-29 00:10:42,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:42,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2018-11-29 00:10:42,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:42,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:42,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:42,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:42,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:42,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-11-29 00:10:42,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:42,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:42,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:42,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2018-11-29 00:10:42,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:42,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:42,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:42,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:42,403 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-29 00:10:42,569 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-29 00:10:42,997 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-11-29 00:10:43,058 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:43,058 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:43,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:43,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:43,059 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:43,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:43,059 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:43,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:43,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-29 00:10:43,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:43,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:43,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,571 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-29 00:10:43,656 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:43,656 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:43,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:43,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:43,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:43,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:43,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:43,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,783 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:43,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,787 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:43,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:43,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:43,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,808 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:43,809 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:43,809 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:10:43,809 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:43,810 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:10:43,810 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:43,810 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-29 00:10:43,846 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:10:43,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-29 00:10:43,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:43,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:43,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:44,066 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 [2018-11-29 00:10:44,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-29 00:10:44,089 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2018-11-29 00:10:44,090 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 [2018-11-29 00:10:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-29 00:10:44,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-29 00:10:44,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:44,091 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:10:44,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:44,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:44,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:44,202 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:44,203 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-29 00:10:44,226 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2018-11-29 00:10:44,227 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 [2018-11-29 00:10:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-29 00:10:44,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-29 00:10:44,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:44,228 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:10:44,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:44,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:44,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:44,271 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:44,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-29 00:10:44,296 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 6 states. [2018-11-29 00:10:44,298 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 [2018-11-29 00:10:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-29 00:10:44,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-29 00:10:44,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:44,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-29 00:10:44,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:44,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-29 00:10:44,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:44,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2018-11-29 00:10:44,303 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:44,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-11-29 00:10:44,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:10:44,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:10:44,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:10:44,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:44,304 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:44,304 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:44,304 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:44,304 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:10:44,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:10:44,304 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:44,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:10:44,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:10:44 BoogieIcfgContainer [2018-11-29 00:10:44,314 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:10:44,315 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:10:44,315 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:10:44,315 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:10:44,316 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:37" (3/4) ... [2018-11-29 00:10:44,323 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:10:44,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:10:44,325 INFO L168 Benchmark]: Toolchain (without parser) took 8236.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 950.0 MB in the beginning and 1.0 GB in the end (delta: -63.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:44,328 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. [2018-11-29 00:10:44,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.19 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 928.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:44,332 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:44,333 INFO L168 Benchmark]: Boogie Preprocessor took 48.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:44,334 INFO L168 Benchmark]: RCFGBuilder took 387.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:44,336 INFO L168 Benchmark]: BuchiAutomizer took 7062.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.4 MB). Peak memory consumption was 156.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:44,338 INFO L168 Benchmark]: Witness Printer took 9.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:44,344 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 593.19 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 928.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 129.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 387.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7062.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.4 MB). Peak memory consumption was 156.6 MB. Max. memory is 11.5 GB. * Witness Printer took 9.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.9s. 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 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 33 SDslu, 1 SDs, 0 SdLazy, 43 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital135 mio100 ax100 hnf98 lsp90 ukn80 mio100 lsp59 div100 bol100 ite100 ukn100 eq176 hnf89 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...