./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/array15_alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/array15_alloca_false-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:47:45,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:47:45,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:47:45,899 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:47:45,900 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:47:45,901 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:47:45,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:47:45,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:47:45,906 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:47:45,907 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:47:45,908 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:47:45,908 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:47:45,909 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:47:45,910 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:47:45,911 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:47:45,912 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:47:45,913 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:47:45,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:47:45,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:47:45,919 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:47:45,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:47:45,922 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:47:45,924 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:47:45,924 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:47:45,925 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:47:45,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:47:45,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:47:45,928 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:47:45,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:47:45,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:47:45,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:47:45,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:47:45,931 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:47:45,932 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:47:45,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:47:45,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:47:45,934 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:47:45,950 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:47:45,951 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:47:45,952 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:47:45,952 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:47:45,952 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:47:45,952 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:47:45,953 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:47:45,953 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:47:45,954 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:47:45,954 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:47:45,954 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:47:45,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:47:45,954 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:47:45,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:47:45,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:47:45,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:47:45,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:47:45,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:47:45,956 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:47:45,956 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:47:45,957 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:47:45,957 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:47:45,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:47:45,958 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:47:45,958 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:47:45,958 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:47:45,958 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:47:45,959 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:47:45,960 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:47:45,961 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 [2019-01-14 02:47:45,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:47:46,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:47:46,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:47:46,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:47:46,013 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:47:46,014 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array15_alloca_false-termination.c.i [2019-01-14 02:47:46,070 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664f5dbc3/2cddf643577c408292c50b1c077e16ce/FLAGa1349460e [2019-01-14 02:47:46,615 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:47:46,616 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array15_alloca_false-termination.c.i [2019-01-14 02:47:46,627 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664f5dbc3/2cddf643577c408292c50b1c077e16ce/FLAGa1349460e [2019-01-14 02:47:46,906 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664f5dbc3/2cddf643577c408292c50b1c077e16ce [2019-01-14 02:47:46,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:47:46,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:47:46,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:47:46,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:47:46,919 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:47:46,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:47:46" (1/1) ... [2019-01-14 02:47:46,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ebf076e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:46, skipping insertion in model container [2019-01-14 02:47:46,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:47:46" (1/1) ... [2019-01-14 02:47:46,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:47:46,978 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:47:47,389 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:47:47,407 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:47:47,462 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:47:47,618 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:47:47,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:47 WrapperNode [2019-01-14 02:47:47,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:47:47,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:47:47,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:47:47,619 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:47:47,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:47" (1/1) ... [2019-01-14 02:47:47,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:47" (1/1) ... [2019-01-14 02:47:47,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:47:47,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:47:47,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:47:47,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:47:47,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:47" (1/1) ... [2019-01-14 02:47:47,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:47" (1/1) ... [2019-01-14 02:47:47,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:47" (1/1) ... [2019-01-14 02:47:47,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:47" (1/1) ... [2019-01-14 02:47:47,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:47" (1/1) ... [2019-01-14 02:47:47,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:47" (1/1) ... [2019-01-14 02:47:47,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:47" (1/1) ... [2019-01-14 02:47:47,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:47:47,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:47:47,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:47:47,699 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:47:47,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:47:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:47:47,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:47:47,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:47:47,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:47:47,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:47:48,141 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:47:48,142 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:47:48,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:48 BoogieIcfgContainer [2019-01-14 02:47:48,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:47:48,144 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:47:48,144 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:47:48,148 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:47:48,148 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:48,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:47:46" (1/3) ... [2019-01-14 02:47:48,150 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@469eb9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:47:48, skipping insertion in model container [2019-01-14 02:47:48,150 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:48,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:47" (2/3) ... [2019-01-14 02:47:48,150 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@469eb9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:47:48, skipping insertion in model container [2019-01-14 02:47:48,151 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:48,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:48" (3/3) ... [2019-01-14 02:47:48,152 INFO L375 chiAutomizerObserver]: Analyzing ICFG array15_alloca_false-termination.c.i [2019-01-14 02:47:48,208 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:47:48,209 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:47:48,209 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:47:48,209 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:47:48,209 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:47:48,209 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:47:48,209 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:47:48,210 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:47:48,210 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:47:48,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:47:48,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 02:47:48,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:48,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:48,251 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:47:48,251 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:47:48,251 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:47:48,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:47:48,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-14 02:47:48,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:48,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:48,254 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:47:48,254 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:47:48,263 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2019-01-14 02:47:48,263 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume main_#t~mem209 < 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2019-01-14 02:47:48,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:48,273 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-14 02:47:48,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:48,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:48,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:48,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:48,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-01-14 02:47:48,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:48,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:48,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:48,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:48,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:48,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:48,444 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-01-14 02:47:48,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:48,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:48,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:48,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:48,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:48,633 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 02:47:48,985 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-01-14 02:47:49,048 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:47:49,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:47:49,049 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:47:49,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:47:49,050 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:47:49,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:49,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:47:49,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:47:49,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca_false-termination.c.i_Iteration1_Lasso [2019-01-14 02:47:49,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:47:49,051 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:47:49,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:49,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:49,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:49,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:49,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:49,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:49,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:49,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:49,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:49,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:49,333 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-14 02:47:49,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:49,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:49,669 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-14 02:47:49,773 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 02:47:50,037 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:50,043 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:50,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:50,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:50,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:50,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:50,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:50,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:50,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:50,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:50,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:50,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:50,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:50,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:50,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:50,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:50,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:50,238 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:50,275 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:47:50,276 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:47:50,278 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:50,280 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:47:50,280 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:50,281 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-14 02:47:50,324 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:47:50,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:47:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:50,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:50,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:50,434 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:47:50,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-14 02:47:50,502 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2019-01-14 02:47:50,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:47:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:47:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-01-14 02:47:50,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:47:50,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:50,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 02:47:50,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:50,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 02:47:50,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:50,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2019-01-14 02:47:50,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:50,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2019-01-14 02:47:50,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:47:50,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:47:50,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-01-14 02:47:50,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:47:50,521 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-14 02:47:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-01-14 02:47:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-14 02:47:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:47:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-01-14 02:47:50,543 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-14 02:47:50,544 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-14 02:47:50,544 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:47:50,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-01-14 02:47:50,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:50,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:50,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:50,545 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:50,546 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:50,546 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2019-01-14 02:47:50,546 INFO L796 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 118#L378-2 [2019-01-14 02:47:50,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-01-14 02:47:50,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:50,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:50,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:50,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:50,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:50,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:47:50,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:47:50,632 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:47:50,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:50,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-01-14 02:47:50,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:50,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:50,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:50,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:50,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:47:50,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:47:50,774 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-14 02:47:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:47:50,822 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-01-14 02:47:50,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:47:50,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-01-14 02:47:50,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:50,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-01-14 02:47:50,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:47:50,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:47:50,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-01-14 02:47:50,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:47:50,828 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-14 02:47:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-01-14 02:47:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-01-14 02:47:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:47:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-14 02:47:50,831 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:47:50,832 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:47:50,832 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:47:50,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-14 02:47:50,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:50,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:50,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:50,833 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:50,834 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:50,834 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2019-01-14 02:47:50,834 INFO L796 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 151#L378-2 [2019-01-14 02:47:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-01-14 02:47:50,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:50,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:50,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:50,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:50,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-01-14 02:47:50,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:50,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:50,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:50,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:50,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:50,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-01-14 02:47:50,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:50,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:50,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:50,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:51,074 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 02:47:51,349 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-01-14 02:47:51,425 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:47:51,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:47:51,425 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:47:51,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:47:51,425 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:47:51,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:51,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:47:51,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:47:51,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca_false-termination.c.i_Iteration3_Lasso [2019-01-14 02:47:51,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:47:51,426 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:47:51,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:51,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:51,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:51,613 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-14 02:47:51,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:51,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:51,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:51,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:51,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:51,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:51,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:51,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:51,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:52,062 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:52,062 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:52,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:52,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:52,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:52,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:52,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:52,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:52,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:52,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:52,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:52,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:52,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:52,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:52,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:52,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:52,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:52,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:52,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:52,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:52,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:52,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:52,071 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:47:52,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:52,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:52,073 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:47:52,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:52,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:52,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:52,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:52,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:52,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:52,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:52,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:52,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:52,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:52,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:52,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:52,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:52,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:52,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:52,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:52,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:52,163 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:52,202 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:47:52,206 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:47:52,207 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:52,208 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:47:52,208 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:52,208 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-01-14 02:47:52,233 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:47:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:52,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:52,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:52,432 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:47:52,432 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:47:52,448 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2019-01-14 02:47:52,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:47:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:47:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-01-14 02:47:52,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 02:47:52,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:52,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 02:47:52,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:52,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-14 02:47:52,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:52,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-01-14 02:47:52,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:52,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-01-14 02:47:52,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:47:52,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:47:52,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-14 02:47:52,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:47:52,456 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 02:47:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-14 02:47:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 02:47:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:47:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-01-14 02:47:52,459 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 02:47:52,459 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 02:47:52,459 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:47:52,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-01-14 02:47:52,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:52,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:52,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:52,462 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:52,462 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:52,464 INFO L794 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 246#L367 assume !(main_~length~0 < 1); 255#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 243#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 254#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 250#L378-2 [2019-01-14 02:47:52,464 INFO L796 eck$LassoCheckResult]: Loop: 250#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 251#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 250#L378-2 [2019-01-14 02:47:52,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-01-14 02:47:52,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:52,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:52,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:52,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:52,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:52,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:52,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-01-14 02:47:52,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:52,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:52,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:52,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:52,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:52,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:52,500 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-01-14 02:47:52,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:52,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:52,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:52,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:52,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:52,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:47:52,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:47:52,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:52,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:52,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:47:52,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-01-14 02:47:52,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:47:52,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:47:52,788 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 10 states. [2019-01-14 02:47:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:47:53,076 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2019-01-14 02:47:53,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:47:53,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. [2019-01-14 02:47:53,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:53,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 28 transitions. [2019-01-14 02:47:53,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:47:53,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:47:53,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-01-14 02:47:53,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:47:53,081 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-01-14 02:47:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-01-14 02:47:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-14 02:47:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 02:47:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-01-14 02:47:53,085 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 02:47:53,086 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 02:47:53,086 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:47:53,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-01-14 02:47:53,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:53,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:53,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:53,090 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:53,090 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:53,090 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 360#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 361#L367 assume !(main_~length~0 < 1); 370#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 371#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 372#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 375#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 373#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 374#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 358#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 359#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 376#L370-3 assume !(main_~i~0 < main_~length~0); 362#L370-4 main_~j~0 := 0; 363#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 369#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 365#L378-2 [2019-01-14 02:47:53,090 INFO L796 eck$LassoCheckResult]: Loop: 365#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 366#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 365#L378-2 [2019-01-14 02:47:53,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:53,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2019-01-14 02:47:53,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:53,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:53,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:53,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:53,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-01-14 02:47:53,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:53,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:53,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:53,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:53,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:53,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:53,152 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2019-01-14 02:47:53,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:53,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:53,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:53,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:53,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:53,374 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 02:47:54,023 WARN L181 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2019-01-14 02:47:54,076 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:47:54,077 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:47:54,077 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:47:54,077 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:47:54,077 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:47:54,077 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:54,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:47:54,077 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:47:54,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca_false-termination.c.i_Iteration5_Lasso [2019-01-14 02:47:54,078 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:47:54,078 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:47:54,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,443 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-01-14 02:47:54,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:54,906 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:54,906 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:54,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:54,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:54,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:54,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:54,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:54,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:54,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:54,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:54,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:54,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:54,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:54,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:54,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:54,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:54,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:54,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:54,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:54,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:54,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:54,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:54,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:54,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:54,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:54,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:54,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:54,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:54,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:54,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:54,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:54,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:54,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:54,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:54,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:54,961 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:54,974 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:47:54,974 INFO L444 ModelExtractionUtils]: 22 out of 25 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:47:54,974 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:54,977 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:47:54,978 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:54,978 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-01-14 02:47:54,995 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 02:47:55,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:55,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:55,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:55,065 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:47:55,065 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 02:47:55,083 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 31 transitions. Complement of second has 5 states. [2019-01-14 02:47:55,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:47:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:47:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-14 02:47:55,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-01-14 02:47:55,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:55,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-01-14 02:47:55,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:55,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-14 02:47:55,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:55,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2019-01-14 02:47:55,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:55,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2019-01-14 02:47:55,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:47:55,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:47:55,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-01-14 02:47:55,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:47:55,089 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-01-14 02:47:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-01-14 02:47:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 02:47:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 02:47:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-01-14 02:47:55,091 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-01-14 02:47:55,091 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-01-14 02:47:55,091 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:47:55,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-01-14 02:47:55,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:55,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:55,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:55,093 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:55,093 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:55,093 INFO L794 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 488#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 489#L367 assume !(main_~length~0 < 1); 500#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 501#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 502#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 506#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 503#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 504#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 490#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 491#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 507#L370-3 assume !(main_~i~0 < main_~length~0); 492#L370-4 main_~j~0 := 0; 493#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 499#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 505#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 508#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 495#L378-2 [2019-01-14 02:47:55,093 INFO L796 eck$LassoCheckResult]: Loop: 495#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 496#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 495#L378-2 [2019-01-14 02:47:55,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:55,094 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2019-01-14 02:47:55,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:55,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:55,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:55,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:55,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:55,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:55,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-01-14 02:47:55,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:55,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:55,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:55,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:55,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:55,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:55,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2019-01-14 02:47:55,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:55,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:55,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:55,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:55,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:55,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:47:55,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:47:55,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:47:55,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 02:47:55,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:47:55,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:55,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:47:55,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-01-14 02:47:55,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 02:47:55,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-14 02:47:55,446 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 13 states. [2019-01-14 02:47:55,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:47:55,575 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-01-14 02:47:55,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:47:55,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-01-14 02:47:55,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 02:47:55,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2019-01-14 02:47:55,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 02:47:55,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 02:47:55,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2019-01-14 02:47:55,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:47:55,579 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2019-01-14 02:47:55,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2019-01-14 02:47:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-01-14 02:47:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 02:47:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-01-14 02:47:55,585 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-01-14 02:47:55,586 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-01-14 02:47:55,586 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:47:55,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2019-01-14 02:47:55,586 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:47:55,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:55,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:55,589 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:55,590 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-14 02:47:55,590 INFO L794 eck$LassoCheckResult]: Stem: 643#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 637#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 638#L367 assume !(main_~length~0 < 1); 649#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 650#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 651#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 657#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 660#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 658#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 659#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 652#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 653#L370-3 assume !(main_~i~0 < main_~length~0); 641#L370-4 main_~j~0 := 0; 642#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 662#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 661#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 655#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 656#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 672#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 670#L378-2 [2019-01-14 02:47:55,590 INFO L796 eck$LassoCheckResult]: Loop: 670#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 667#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 644#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 645#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 670#L378-2 [2019-01-14 02:47:55,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:55,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2019-01-14 02:47:55,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:55,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:55,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:55,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:55,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:55,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:55,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-01-14 02:47:55,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:55,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:55,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:55,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:47:55,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:55,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:55,623 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2019-01-14 02:47:55,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:55,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:55,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:55,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:55,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:55,974 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-01-14 02:47:56,129 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 02:47:56,505 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 103 [2019-01-14 02:47:56,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:47:56 BoogieIcfgContainer [2019-01-14 02:47:56,616 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:47:56,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:47:56,617 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:47:56,617 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:47:56,617 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:48" (3/4) ... [2019-01-14 02:47:56,623 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:47:56,687 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:47:56,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:47:56,689 INFO L168 Benchmark]: Toolchain (without parser) took 9776.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 943.3 MB in the beginning and 890.4 MB in the end (delta: 52.9 MB). Peak memory consumption was 273.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:56,692 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:47:56,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -204.8 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:56,695 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:56,697 INFO L168 Benchmark]: Boogie Preprocessor took 31.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:47:56,699 INFO L168 Benchmark]: RCFGBuilder took 445.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:56,700 INFO L168 Benchmark]: BuchiAutomizer took 8472.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 898.1 MB in the end (delta: 219.0 MB). Peak memory consumption was 291.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:56,702 INFO L168 Benchmark]: Witness Printer took 71.35 ms. Allocated memory is still 1.2 GB. Free memory was 898.1 MB in the beginning and 890.4 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:56,708 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 703.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -204.8 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 445.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8472.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 898.1 MB in the end (delta: 219.0 MB). Peak memory consumption was 291.9 MB. Max. memory is 11.5 GB. * Witness Printer took 71.35 ms. Allocated memory is still 1.2 GB. Free memory was 898.1 MB in the beginning and 890.4 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function unknown-#length-unknown[arr] + -1 * arr + -4 * i and consists of 5 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 7.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 66 SDtfs, 105 SDslu, 81 SDs, 0 SdLazy, 191 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital124 mio100 ax100 hnf98 lsp93 ukn82 mio100 lsp61 div100 bol100 ite100 ukn100 eq163 hnf88 smp95 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, \result=0, NULL=0, arr=-1, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d5aec9f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5199044=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e965f35=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@10b7dbb7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e965f35=-1, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6ef61fd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@c711aa2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3e20cc6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@36c9b56=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L381] j++ [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ Loop: [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...