./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array01-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array01-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e0283c2b515067609d1d09b2bc4afe3d1f1d910 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:39,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:39,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:39,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:39,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:39,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:39,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:39,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:39,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:39,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:39,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:39,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:39,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:39,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:39,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:39,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:39,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:39,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:39,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:39,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:39,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:39,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:39,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:39,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:39,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:39,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:39,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:39,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:39,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:39,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:39,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:39,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:39,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:39,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:39,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:39,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:39,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:39,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:39,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:39,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:39,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:39,812 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:02:39,830 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:39,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:39,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:39,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:39,832 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:39,832 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:39,832 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:39,832 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:39,832 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:39,832 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:39,834 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:39,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:39,835 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:39,835 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:39,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:39,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:39,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:39,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:39,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:39,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:39,836 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:39,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:39,836 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:39,836 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:39,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:39,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:39,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:39,836 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:39,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:39,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:39,837 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:39,838 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:39,838 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e0283c2b515067609d1d09b2bc4afe3d1f1d910 [2019-10-22 09:02:39,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:39,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:39,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:39,886 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:39,886 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:39,887 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2019-10-22 09:02:39,934 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer/data/c8e4154e5/2366f1876ea04f24bd8c9d247b6c0f26/FLAGbed3680e4 [2019-10-22 09:02:40,334 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:40,335 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2019-10-22 09:02:40,344 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer/data/c8e4154e5/2366f1876ea04f24bd8c9d247b6c0f26/FLAGbed3680e4 [2019-10-22 09:02:40,356 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer/data/c8e4154e5/2366f1876ea04f24bd8c9d247b6c0f26 [2019-10-22 09:02:40,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:40,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:40,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:40,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:40,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:40,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371b570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40, skipping insertion in model container [2019-10-22 09:02:40,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,373 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:40,400 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:40,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:40,720 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:40,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:40,816 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:40,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40 WrapperNode [2019-10-22 09:02:40,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:40,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:40,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:40,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:40,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:40,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:40,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:40,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:40,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... [2019-10-22 09:02:40,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:40,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:40,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:40,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:40,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer/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-10-22 09:02:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:41,334 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:41,334 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 09:02:41,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:41 BoogieIcfgContainer [2019-10-22 09:02:41,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:41,336 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:41,336 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:41,340 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:41,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:41,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:40" (1/3) ... [2019-10-22 09:02:41,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69558a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:41, skipping insertion in model container [2019-10-22 09:02:41,342 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:41,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:40" (2/3) ... [2019-10-22 09:02:41,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69558a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:41, skipping insertion in model container [2019-10-22 09:02:41,342 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:41,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:41" (3/3) ... [2019-10-22 09:02:41,344 INFO L371 chiAutomizerObserver]: Analyzing ICFG array01-alloca-2.i [2019-10-22 09:02:41,384 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:41,384 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:41,384 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:41,384 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:41,385 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:41,385 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:41,385 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:41,385 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:41,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 09:02:41,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:41,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:41,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:41,433 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:02:41,433 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:41,433 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:41,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 09:02:41,435 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:41,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:41,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:41,437 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 09:02:41,437 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:41,444 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 4#L526true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7#L526-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~k~0 := 0; 16#L531-3true [2019-10-22 09:02:41,444 INFO L793 eck$LassoCheckResult]: Loop: 16#L531-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 15#L531-2true main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 16#L531-3true [2019-10-22 09:02:41,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,450 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 09:02:41,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:41,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359055684] [2019-10-22 09:02:41,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,584 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-10-22 09:02:41,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:41,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677640271] [2019-10-22 09:02:41,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,604 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:41,606 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-10-22 09:02:41,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:41,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111181990] [2019-10-22 09:02:41,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:41,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:41,639 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:41,789 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:41,790 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:41,790 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:41,790 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:41,790 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:41,790 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:41,790 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:41,790 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:41,791 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration1_Lasso [2019-10-22 09:02:41,791 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:41,791 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:41,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:41,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:41,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:41,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:41,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:41,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:41,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:41,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:41,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:41,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:42,181 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:42,186 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:42,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,191 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,192 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,192 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,192 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,194 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,194 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,207 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,208 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,208 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,210 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,210 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,214 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,233 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,234 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,242 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,243 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,243 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,244 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,244 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,266 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,267 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:42,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,267 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:42,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:42,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:42,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:42,270 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:42,270 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:42,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:42,270 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:42,274 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:42,281 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:42,386 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:42,413 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:02:42,413 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:42,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:42,417 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:42,417 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:42,418 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2019-10-22 09:02:42,427 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:02:42,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:42,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:42,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:42,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:42,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:42,500 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-10-22 09:02:42,501 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-10-22 09:02:42,563 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 53 transitions. Complement of second has 7 states. [2019-10-22 09:02:42,565 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-10-22 09:02:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-10-22 09:02:42,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 09:02:42,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:42,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 09:02:42,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:42,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 4 letters. [2019-10-22 09:02:42,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:42,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-10-22 09:02:42,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:42,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 16 transitions. [2019-10-22 09:02:42,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:02:42,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:02:42,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-10-22 09:02:42,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:42,588 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:02:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-10-22 09:02:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-22 09:02:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:02:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-10-22 09:02:42,617 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:02:42,617 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:02:42,617 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:42,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-10-22 09:02:42,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:42,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:42,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:42,619 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:02:42,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:42,619 INFO L791 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 114#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 115#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 116#L526-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~k~0 := 0; 119#L531-3 assume !(main_~k~0 < main_~array_size~0); 122#L531-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 118#L516-3 [2019-10-22 09:02:42,619 INFO L793 eck$LassoCheckResult]: Loop: 118#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 113#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 111#L517-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 112#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 118#L516-3 [2019-10-22 09:02:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,620 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-10-22 09:02:42,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:42,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990403360] [2019-10-22 09:02:42,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:42,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990403360] [2019-10-22 09:02:42,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:42,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:42,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473899948] [2019-10-22 09:02:42,681 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:42,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2019-10-22 09:02:42,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:42,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460677842] [2019-10-22 09:02:42,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,692 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:42,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:42,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:42,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:42,729 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 09:02:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:42,757 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-10-22 09:02:42,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:42,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-10-22 09:02:42,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:42,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2019-10-22 09:02:42,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:02:42,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:02:42,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2019-10-22 09:02:42,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:42,760 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-10-22 09:02:42,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2019-10-22 09:02:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-10-22 09:02:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:02:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-10-22 09:02:42,762 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 09:02:42,762 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 09:02:42,763 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:42,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-10-22 09:02:42,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:42,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:42,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:42,764 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:42,764 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:42,764 INFO L791 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 144#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 148#L526-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~k~0 := 0; 151#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 152#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 153#L531-3 assume !(main_~k~0 < main_~array_size~0); 154#L531-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 150#L516-3 [2019-10-22 09:02:42,765 INFO L793 eck$LassoCheckResult]: Loop: 150#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 147#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 145#L517-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 146#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 150#L516-3 [2019-10-22 09:02:42,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,765 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-10-22 09:02:42,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:42,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432294358] [2019-10-22 09:02:42,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,810 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:42,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2019-10-22 09:02:42,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:42,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641112053] [2019-10-22 09:02:42,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,829 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:42,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:42,829 INFO L82 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2019-10-22 09:02:42,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:42,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437577983] [2019-10-22 09:02:42,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:42,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:42,869 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:43,077 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-10-22 09:02:43,158 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:43,158 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:43,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:43,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:43,158 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:43,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:43,159 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:43,159 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:43,159 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration3_Lasso [2019-10-22 09:02:43,159 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:43,159 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:43,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,321 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-22 09:02:43,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:43,750 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:43,751 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:43,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:43,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:43,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:43,752 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:43,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:43,754 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:43,754 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:43,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:43,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:43,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:43,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:43,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:43,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:43,761 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:43,761 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:43,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:43,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:43,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:43,769 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:43,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:43,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:43,770 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:43,771 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:43,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:43,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:43,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:43,774 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:43,774 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:43,774 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:43,776 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:43,777 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:43,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:43,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:43,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:43,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:43,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:43,798 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:43,803 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:43,803 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:43,838 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:43,865 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:43,866 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:02:43,867 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:43,868 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:43,868 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:43,869 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2019-10-22 09:02:43,878 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:02:43,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:43,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:43,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:43,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:43,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:43,930 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-10-22 09:02:43,930 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 09:02:43,949 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 17 states and 22 transitions. Complement of second has 4 states. [2019-10-22 09:02:43,950 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-10-22 09:02:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-10-22 09:02:43,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2019-10-22 09:02:43,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:43,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2019-10-22 09:02:43,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:43,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 8 letters. [2019-10-22 09:02:43,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:43,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-10-22 09:02:43,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:43,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 21 transitions. [2019-10-22 09:02:43,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:02:43,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:02:43,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-10-22 09:02:43,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:43,953 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-10-22 09:02:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-10-22 09:02:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-22 09:02:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:02:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-10-22 09:02:43,954 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:43,954 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:43,954 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:43,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-10-22 09:02:43,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:43,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:43,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:43,955 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:43,955 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:43,955 INFO L791 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 250#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 251#L526-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~k~0 := 0; 254#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 255#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 256#L531-3 assume !(main_~k~0 < main_~array_size~0); 258#L531-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 257#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 245#L517-3 [2019-10-22 09:02:43,955 INFO L793 eck$LassoCheckResult]: Loop: 245#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 244#L517-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 245#L517-3 [2019-10-22 09:02:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2019-10-22 09:02:43,956 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:43,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653707007] [2019-10-22 09:02:43,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:43,977 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2019-10-22 09:02:43,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:43,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216232424] [2019-10-22 09:02:43,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:43,987 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:43,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2019-10-22 09:02:43,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:43,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130136909] [2019-10-22 09:02:43,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:44,013 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:44,180 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-22 09:02:44,236 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:44,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:44,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:44,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:44,237 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:44,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:44,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:44,237 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:44,237 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration4_Lasso [2019-10-22 09:02:44,237 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:44,237 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:44,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,380 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-22 09:02:44,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-10-22 09:02:44,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-10-22 09:02:44,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:44,804 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:44,804 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:44,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,805 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,805 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:44,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,805 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,806 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:44,806 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:44,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,807 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,807 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,808 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:44,808 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:44,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,811 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,811 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,811 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,812 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:44,812 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:44,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,817 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:44,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,817 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,818 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:44,818 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:44,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:44,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,820 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:44,820 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:44,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,821 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,822 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,822 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,822 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:44,822 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:44,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:44,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,826 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:44,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:44,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,827 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:44,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,828 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:44,828 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:44,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:44,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,830 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:44,830 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:44,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,831 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:44,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,831 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,832 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,832 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:44,832 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:44,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,834 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,834 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,834 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,834 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,834 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:44,835 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:44,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,836 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:44,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,837 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:44,838 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:44,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,839 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:44,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,841 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:44,841 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:44,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:44,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:44,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:44,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:44,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:44,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:44,851 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:44,851 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:44,857 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:44,859 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:44,860 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:44,860 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:44,861 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:44,861 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:44,861 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1 Supporting invariants [] [2019-10-22 09:02:44,874 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:02:44,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:02:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:44,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:44,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:44,920 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-10-22 09:02:44,920 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 09:02:44,937 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 24 states and 31 transitions. Complement of second has 7 states. [2019-10-22 09:02:44,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-10-22 09:02:44,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 09:02:44,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:44,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 09:02:44,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:44,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 09:02:44,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:44,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2019-10-22 09:02:44,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:44,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 24 transitions. [2019-10-22 09:02:44,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:02:44,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 09:02:44,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-10-22 09:02:44,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:44,941 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-22 09:02:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-10-22 09:02:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-10-22 09:02:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 09:02:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-10-22 09:02:44,942 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-10-22 09:02:44,942 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-10-22 09:02:44,943 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:02:44,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-10-22 09:02:44,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:44,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:44,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:44,944 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:44,944 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:44,944 INFO L791 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 368#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 369#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 370#L526-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~k~0 := 0; 376#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 378#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 379#L531-3 assume !(main_~k~0 < main_~array_size~0); 380#L531-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 377#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 367#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 381#L517-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 372#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 373#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 365#L517-3 [2019-10-22 09:02:44,944 INFO L793 eck$LassoCheckResult]: Loop: 365#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 364#L517-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 365#L517-3 [2019-10-22 09:02:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762469, now seen corresponding path program 2 times [2019-10-22 09:02:44,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:44,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973984373] [2019-10-22 09:02:44,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:45,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973984373] [2019-10-22 09:02:45,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974775491] [2019-10-22 09:02:45,012 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ecb53295-8cde-4ef4-b663-c07ece7c983d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:45,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:02:45,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:02:45,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:02:45,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:45,148 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:45,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2019-10-22 09:02:45,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075802211] [2019-10-22 09:02:45,149 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:45,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:45,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2019-10-22 09:02:45,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:45,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150667948] [2019-10-22 09:02:45,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:45,160 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:45,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:45,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 09:02:45,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:02:45,190 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-10-22 09:02:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:45,315 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-10-22 09:02:45,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:02:45,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-10-22 09:02:45,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:45,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 21 states and 25 transitions. [2019-10-22 09:02:45,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 09:02:45,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 09:02:45,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2019-10-22 09:02:45,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:45,318 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-22 09:02:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2019-10-22 09:02:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-10-22 09:02:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 09:02:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-22 09:02:45,319 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-22 09:02:45,320 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-22 09:02:45,320 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:02:45,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2019-10-22 09:02:45,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:45,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:45,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:45,321 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:45,321 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:45,321 INFO L791 eck$LassoCheckResult]: Stem: 481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 478#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 479#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 480#L526-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~k~0 := 0; 486#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 490#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 491#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 487#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 488#L531-3 assume !(main_~k~0 < main_~array_size~0); 492#L531-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 489#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 477#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 493#L517-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 484#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 485#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 475#L517-3 [2019-10-22 09:02:45,321 INFO L793 eck$LassoCheckResult]: Loop: 475#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 474#L517-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 475#L517-3 [2019-10-22 09:02:45,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:45,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1166615491, now seen corresponding path program 3 times [2019-10-22 09:02:45,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:45,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649692822] [2019-10-22 09:02:45,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:45,360 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:45,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:45,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2019-10-22 09:02:45,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:45,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953964576] [2019-10-22 09:02:45,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:45,372 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:45,374 INFO L82 PathProgramCache]: Analyzing trace with hash 131023752, now seen corresponding path program 1 times [2019-10-22 09:02:45,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:45,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194581325] [2019-10-22 09:02:45,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:45,400 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:45,737 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2019-10-22 09:02:45,825 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:45,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:45,825 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:45,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:45,825 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:45,826 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:45,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:45,826 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:45,826 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration6_Lasso [2019-10-22 09:02:45,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:45,826 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:45,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:45,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:46,023 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-22 09:02:46,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:46,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:46,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-10-22 09:02:46,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:46,335 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:46,336 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:46,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,337 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,337 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:46,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:46,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:46,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,340 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:46,340 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:46,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,342 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,343 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:46,343 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:46,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:46,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,349 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,349 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:46,350 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:46,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,351 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,352 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:46,352 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:46,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,354 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:46,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,355 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,355 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:46,355 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:46,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,356 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:46,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,356 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:46,356 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:46,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,358 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:46,358 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,358 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,358 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,359 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:46,359 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:46,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,360 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,360 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:46,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,361 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:46,361 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:46,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,363 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:46,363 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:46,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:46,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,366 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:46,366 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:46,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,368 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,368 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,368 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:46,368 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:46,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,371 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,371 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:46,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,371 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:46,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:46,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,373 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:46,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,374 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:46,374 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:46,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,382 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:46,383 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:46,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:46,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:46,392 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:46,392 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:46,392 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:46,392 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:46,392 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:46,393 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:46,393 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:46,394 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:46,395 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:46,395 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:46,395 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:46,396 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:02:46,396 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:46,396 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2019-10-22 09:02:46,415 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:02:46,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:02:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:46,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:46,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:46,471 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-10-22 09:02:46,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 09:02:46,488 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 24 states and 28 transitions. Complement of second has 7 states. [2019-10-22 09:02:46,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-10-22 09:02:46,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 15 letters. Loop has 2 letters. [2019-10-22 09:02:46,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:46,490 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:46,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:46,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:46,538 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:46,538 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 09:02:46,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 24 states and 28 transitions. Complement of second has 7 states. [2019-10-22 09:02:46,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-10-22 09:02:46,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 15 letters. Loop has 2 letters. [2019-10-22 09:02:46,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:46,556 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:02:46,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:46,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:02:46,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:46,598 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:46,598 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 09:02:46,620 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 32 transitions. Complement of second has 6 states. [2019-10-22 09:02:46,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 09:02:46,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2019-10-22 09:02:46,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:46,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 17 letters. Loop has 2 letters. [2019-10-22 09:02:46,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:46,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 09:02:46,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:46,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-10-22 09:02:46,623 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:46,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-10-22 09:02:46,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:46,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:46,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:46,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:46,623 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:46,624 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:46,624 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:46,624 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:02:46,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:46,624 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:46,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:46,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:46 BoogieIcfgContainer [2019-10-22 09:02:46,631 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:46,631 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:46,631 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:46,631 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:46,632 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:41" (3/4) ... [2019-10-22 09:02:46,635 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:46,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:46,636 INFO L168 Benchmark]: Toolchain (without parser) took 6277.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 351.3 MB). Free memory was 935.6 MB in the beginning and 1.2 GB in the end (delta: -274.7 MB). Peak memory consumption was 76.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:46,636 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:46,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 935.6 MB in the beginning and 1.2 GB in the end (delta: -214.8 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:46,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.53 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:46,638 INFO L168 Benchmark]: Boogie Preprocessor took 43.67 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:46,638 INFO L168 Benchmark]: RCFGBuilder took 412.32 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: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:46,639 INFO L168 Benchmark]: BuchiAutomizer took 5294.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -93.4 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:46,639 INFO L168 Benchmark]: Witness Printer took 3.61 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:46,642 INFO L335 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 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 457.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 935.6 MB in the beginning and 1.2 GB in the end (delta: -214.8 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.53 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.67 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 412.32 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: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5294.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -93.4 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.61 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * k + array_size and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][a + i * 4] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 101 SDslu, 81 SDs, 0 SdLazy, 144 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital145 mio100 ax112 hnf99 lsp82 ukn84 mio100 lsp60 div100 bol100 ite100 ukn100 eq176 hnf90 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 5 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...