./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/array07_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/array07_alloca_true-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 77498d00b446eec99f943fd8f68173cd9df2461a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:57:01,700 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:57:01,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:57:01,714 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:57:01,714 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:57:01,715 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:57:01,717 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:57:01,718 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:57:01,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:57:01,721 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:57:01,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:57:01,722 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:57:01,723 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:57:01,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:57:01,725 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:57:01,726 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:57:01,727 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:57:01,729 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:57:01,731 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:57:01,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:57:01,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:57:01,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:57:01,740 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:57:01,743 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:57:01,743 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:57:01,744 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:57:01,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:57:01,749 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:57:01,751 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:57:01,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:57:01,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:57:01,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:57:01,755 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:57:01,755 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:57:01,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:57:01,757 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:57:01,757 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:57:01,786 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:57:01,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:57:01,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:57:01,788 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:57:01,788 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:57:01,789 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:57:01,790 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:57:01,790 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:57:01,790 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:57:01,790 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:57:01,790 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:57:01,791 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:57:01,791 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:57:01,792 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:57:01,792 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:57:01,792 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:57:01,792 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:57:01,792 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:57:01,792 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:57:01,793 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:57:01,793 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:57:01,793 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:57:01,793 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:57:01,793 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:57:01,794 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:57:01,795 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:57:01,796 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:57:01,796 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:57:01,797 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:57:01,797 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 -> 77498d00b446eec99f943fd8f68173cd9df2461a [2019-01-01 21:57:01,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:57:01,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:57:01,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:57:01,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:57:01,860 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:57:01,861 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/array07_alloca_true-termination.c.i [2019-01-01 21:57:01,921 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59126fa28/fc383cbd5dc146469062b252c6dae8e6/FLAG2f382ae02 [2019-01-01 21:57:02,437 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:57:02,437 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/array07_alloca_true-termination.c.i [2019-01-01 21:57:02,449 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59126fa28/fc383cbd5dc146469062b252c6dae8e6/FLAG2f382ae02 [2019-01-01 21:57:02,723 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59126fa28/fc383cbd5dc146469062b252c6dae8e6 [2019-01-01 21:57:02,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:57:02,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:57:02,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:57:02,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:57:02,734 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:57:02,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:57:02" (1/1) ... [2019-01-01 21:57:02,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da92255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:02, skipping insertion in model container [2019-01-01 21:57:02,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:57:02" (1/1) ... [2019-01-01 21:57:02,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:57:02,791 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:57:03,180 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:57:03,197 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:57:03,363 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:57:03,433 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:57:03,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:03 WrapperNode [2019-01-01 21:57:03,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:57:03,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:57:03,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:57:03,435 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:57:03,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:03" (1/1) ... [2019-01-01 21:57:03,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:03" (1/1) ... [2019-01-01 21:57:03,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:57:03,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:57:03,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:57:03,498 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:57:03,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:03" (1/1) ... [2019-01-01 21:57:03,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:03" (1/1) ... [2019-01-01 21:57:03,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:03" (1/1) ... [2019-01-01 21:57:03,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:03" (1/1) ... [2019-01-01 21:57:03,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:03" (1/1) ... [2019-01-01 21:57:03,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:03" (1/1) ... [2019-01-01 21:57:03,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:03" (1/1) ... [2019-01-01 21:57:03,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:57:03,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:57:03,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:57:03,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:57:03,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:57:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:57:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:57:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:57:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:57:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:57:03,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:57:04,036 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:57:04,037 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 21:57:04,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:57:04 BoogieIcfgContainer [2019-01-01 21:57:04,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:57:04,038 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:57:04,038 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:57:04,042 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:57:04,042 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:57:04,043 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:57:02" (1/3) ... [2019-01-01 21:57:04,044 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73b4b3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:57:04, skipping insertion in model container [2019-01-01 21:57:04,044 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:57:04,044 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:57:03" (2/3) ... [2019-01-01 21:57:04,045 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73b4b3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:57:04, skipping insertion in model container [2019-01-01 21:57:04,045 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:57:04,045 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:57:04" (3/3) ... [2019-01-01 21:57:04,047 INFO L375 chiAutomizerObserver]: Analyzing ICFG array07_alloca_true-termination.c.i [2019-01-01 21:57:04,107 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:57:04,108 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:57:04,108 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:57:04,109 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:57:04,109 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:57:04,109 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:57:04,109 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:57:04,109 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:57:04,110 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:57:04,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:57:04,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-01 21:57:04,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:57:04,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:57:04,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:57:04,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:57:04,156 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:57:04,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:57:04,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-01-01 21:57:04,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:57:04,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:57:04,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:57:04,159 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:57:04,168 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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; 14#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; 11#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 15#L370-3true [2019-01-01 21:57:04,168 INFO L796 eck$LassoCheckResult]: Loop: 15#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; 13#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L370-3true [2019-01-01 21:57:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:57:04,175 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-01 21:57:04,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:57:04,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:57:04,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:04,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:57:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:57:04,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-01-01 21:57:04,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:57:04,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:57:04,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:04,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:57:04,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:04,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:57:04,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-01-01 21:57:04,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:57:04,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:57:04,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:04,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:57:04,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:04,767 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-01-01 21:57:04,959 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 21:57:04,984 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:57:04,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:57:04,985 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:57:04,985 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:57:04,986 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:57:04,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:57:04,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:57:04,987 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:57:04,987 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:57:04,987 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:57:04,987 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:57:05,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:05,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:05,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:05,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:05,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:05,355 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-01 21:57:05,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:05,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:05,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:05,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:05,628 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 21:57:05,735 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 21:57:05,858 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 21:57:06,109 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:57:06,143 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:57:06,148 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:57:06,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:06,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:06,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:06,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:06,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:06,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:06,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:06,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:06,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:06,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:06,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:06,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:06,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:06,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:06,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:06,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:06,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:06,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:06,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:06,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:06,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:06,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:06,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:06,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:57:06,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:06,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:06,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:06,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:06,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:06,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:06,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:06,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:06,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:06,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:06,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:06,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:06,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:06,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:06,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:06,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:06,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:57:06,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:06,293 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:57:06,351 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:57:06,351 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:57:06,356 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:57:06,360 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:57:06,361 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:57:06,361 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset Supporting invariants [] [2019-01-01 21:57:06,380 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:57:06,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:57:06,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:57:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:57:06,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:57:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:57:06,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:57:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:57:06,514 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-01 21:57:06,515 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-01-01 21:57:06,585 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 7 states. [2019-01-01 21:57:06,586 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-01 21:57:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:57:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-01 21:57:06,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:57:06,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:57:06,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:57:06,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:57:06,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:57:06,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:57:06,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-01 21:57:06,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:57:06,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2019-01-01 21:57:06,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:57:06,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:57:06,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-01 21:57:06,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:57:06,604 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:57:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-01 21:57:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-01 21:57:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:57:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:57:06,629 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:57:06,629 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:57:06,629 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:57:06,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-01 21:57:06,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:57:06,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:57:06,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:57:06,631 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:57:06,631 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:57:06,632 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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; 105#L367 assume !(main_~length~0 < 1); 108#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; 109#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 110#L370-3 assume !(main_~i~0 < main_~length~0); 106#L370-4 main_~j~0 := 0; 103#L374-2 [2019-01-01 21:57:06,632 INFO L796 eck$LassoCheckResult]: Loop: 103#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~mem209;havoc main_#t~post210; 103#L374-2 [2019-01-01 21:57:06,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:57:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2019-01-01 21:57:06,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:57:06,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:57:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:06,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:57:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:57:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:57:06,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:57:06,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:57:06,727 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:57:06,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:57:06,727 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2019-01-01 21:57:06,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:57:06,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:57:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:06,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:57:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:06,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:57:06,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:57:06,829 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 21:57:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:57:06,871 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-01 21:57:06,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:57:06,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-01 21:57:06,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:57:06,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-01-01 21:57:06,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:57:06,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:57:06,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-01-01 21:57:06,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:57:06,876 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-01 21:57:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-01-01 21:57:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-01 21:57:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:57:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-01 21:57:06,878 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 21:57:06,878 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-01 21:57:06,878 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:57:06,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-01-01 21:57:06,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:57:06,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:57:06,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:57:06,881 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:57:06,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:57:06,881 INFO L794 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, 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; 133#L367 assume !(main_~length~0 < 1); 136#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; 137#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#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; 139#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 140#L370-3 assume !(main_~i~0 < main_~length~0); 134#L370-4 main_~j~0 := 0; 131#L374-2 [2019-01-01 21:57:06,881 INFO L796 eck$LassoCheckResult]: Loop: 131#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~mem209;havoc main_#t~post210; 131#L374-2 [2019-01-01 21:57:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:57:06,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2019-01-01 21:57:06,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:57:06,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:57:06,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:06,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:57:06,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:06,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:57:06,907 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2019-01-01 21:57:06,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:57:06,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:57:06,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:06,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:57:06,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:57:06,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2019-01-01 21:57:06,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:57:06,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:57:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:06,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:57:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:57:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:57:07,378 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-01-01 21:57:07,438 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:57:07,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:57:07,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:57:07,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:57:07,439 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:57:07,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:57:07,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:57:07,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:57:07,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: array07_alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:57:07,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:57:07,440 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:57:07,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:07,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:07,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:07,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:07,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:07,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:07,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-01 21:57:07,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:07,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:57:07,989 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:57:07,990 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:57:07,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:07,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:07,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:07,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:07,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:07,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:07,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:07,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:07,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:07,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:07,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:07,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:07,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:07,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:07,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:07,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:07,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:08,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:08,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:57:08,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:08,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:08,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:08,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:08,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:08,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:08,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:57:08,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:08,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:08,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:57:08,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:08,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,058 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:57:08,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:08,061 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:57:08,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:08,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:08,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:57:08,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:08,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:08,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:08,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:08,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:08,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:08,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:08,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:08,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:08,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:08,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:57:08,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:57:08,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,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-01 21:57:08,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:08,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:57:08,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:57:08,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:08,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,119 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 21:57:08,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:08,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,122 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:57:08,123 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:57:08,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:08,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:08,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,127 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:57:08,129 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:57:08,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:08,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,134 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:57:08,137 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:57:08,137 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:57:08,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:57:08,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,147 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:57:08,147 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 21:57:08,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:57:08,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,154 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:57:08,156 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:57:08,156 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:57:08,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:57:08,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:57:08,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:57:08,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:57:08,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:57:08,166 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 21:57:08,175 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 21:57:08,175 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-01-01 21:57:08,254 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:57:08,310 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-01 21:57:08,311 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:57:08,312 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:57:08,313 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2019-01-01 21:57:08,314 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:57:08,314 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 + 8*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_1 f1 = -8*ULTIMATE.start_main_~j~0 + 8*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-01-01 21:57:08,396 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:57:08,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:57:08,411 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:57:08,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:57:08,412 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:57:08,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:57:08,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:57:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:57:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:57:08,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:57:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:57:08,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:57:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:57:08,738 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:57:08,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-01 21:57:08,769 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 13 transitions. Complement of second has 2 states. [2019-01-01 21:57:08,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-01-01 21:57:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:57:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2019-01-01 21:57:08,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 1 letters. [2019-01-01 21:57:08,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:57:08,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 10 letters. Loop has 1 letters. [2019-01-01 21:57:08,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:57:08,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:57:08,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:57:08,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-01 21:57:08,772 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:57:08,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2019-01-01 21:57:08,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:57:08,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:57:08,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:57:08,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:57:08,773 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:57:08,773 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:57:08,773 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:57:08,773 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:57:08,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:57:08,773 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:57:08,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:57:08,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:57:08 BoogieIcfgContainer [2019-01-01 21:57:08,781 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:57:08,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:57:08,782 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:57:08,782 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:57:08,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:57:04" (3/4) ... [2019-01-01 21:57:08,787 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:57:08,787 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:57:08,788 INFO L168 Benchmark]: Toolchain (without parser) took 6060.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.4 MB in the beginning and 826.5 MB in the end (delta: 124.8 MB). Peak memory consumption was 262.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:57:08,789 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:57:08,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:57:08,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.19 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-01 21:57:08,791 INFO L168 Benchmark]: Boogie Preprocessor took 52.13 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-01 21:57:08,792 INFO L168 Benchmark]: RCFGBuilder took 487.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:57:08,793 INFO L168 Benchmark]: BuchiAutomizer took 4742.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 826.5 MB in the end (delta: 263.7 MB). Peak memory consumption was 263.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:57:08,794 INFO L168 Benchmark]: Witness Printer took 5.19 ms. Allocated memory is still 1.2 GB. Free memory is still 826.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:57:08,798 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 705.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.19 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. * Boogie Preprocessor took 52.13 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 487.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4742.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 826.5 MB in the end (delta: 263.7 MB). Peak memory consumption was 263.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.19 ms. Allocated memory is still 1.2 GB. Free memory is still 826.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[arr] + -4 * i + -1 * arr and consists of 5 locations. One deterministic module has 2-nested ranking function (if unknown-#length-unknown[arr] + 8 * unknown-#memory_int-unknown[arr][arr] > 0 then 1 else 0), (if unknown-#length-unknown[arr] + 8 * unknown-#memory_int-unknown[arr][arr] > 0 then unknown-#length-unknown[arr] + 8 * unknown-#memory_int-unknown[arr][arr] else -8 * j + 8 * length) and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30 SDtfs, 33 SDslu, 12 SDs, 0 SdLazy, 23 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital112 mio100 ax100 hnf99 lsp94 ukn79 mio100 lsp66 div100 bol100 ite100 ukn100 eq169 hnf91 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...