./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array15_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array15_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/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 64bit --witnessprinter.graph.data.programhash 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:58,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:58,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:58,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:58,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:58,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:58,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:58,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:58,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:58,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:58,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:58,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:58,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:58,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:58,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:58,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:58,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:58,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:58,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:58,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:58,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:58,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:58,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:58,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:58,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:58,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:58,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:58,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:58,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:58,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:58,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:58,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:58,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:58,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:58,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:58,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:58,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:58,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:58,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:58,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:58,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:58,919 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:55:58,931 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:58,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:58,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:58,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:58,933 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:58,933 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:58,934 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:58,934 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:58,934 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:58,934 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:58,934 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:58,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:58,935 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:58,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:58,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:58,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:58,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:58,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:58,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:58,936 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:58,936 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:58,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:58,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:58,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:58,937 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:58,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:58,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:58,937 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:58,938 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:58,938 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_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73a986a1d92244ec74fbbfc5c06684e9b6828bb2 [2019-10-22 08:55:58,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:58,978 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:58,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:58,985 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:58,985 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:58,986 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/bin/uautomizer/../../sv-benchmarks/c/termination-15/array15_alloca.i [2019-10-22 08:55:59,041 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/bin/uautomizer/data/6e4fa659e/0d359e223276420f927dfb4505dae90b/FLAG422246ea1 [2019-10-22 08:55:59,514 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:59,518 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/sv-benchmarks/c/termination-15/array15_alloca.i [2019-10-22 08:55:59,530 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/bin/uautomizer/data/6e4fa659e/0d359e223276420f927dfb4505dae90b/FLAG422246ea1 [2019-10-22 08:56:00,012 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/bin/uautomizer/data/6e4fa659e/0d359e223276420f927dfb4505dae90b [2019-10-22 08:56:00,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:00,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:00,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:00,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:00,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:00,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:00" (1/1) ... [2019-10-22 08:56:00,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b10e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00, skipping insertion in model container [2019-10-22 08:56:00,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:00" (1/1) ... [2019-10-22 08:56:00,035 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:00,067 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:00,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:00,422 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:00,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:00,518 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:00,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00 WrapperNode [2019-10-22 08:56:00,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:00,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:00,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:00,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:00,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00" (1/1) ... [2019-10-22 08:56:00,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00" (1/1) ... [2019-10-22 08:56:00,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:00,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:00,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:00,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:00,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00" (1/1) ... [2019-10-22 08:56:00,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00" (1/1) ... [2019-10-22 08:56:00,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00" (1/1) ... [2019-10-22 08:56:00,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00" (1/1) ... [2019-10-22 08:56:00,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00" (1/1) ... [2019-10-22 08:56:00,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00" (1/1) ... [2019-10-22 08:56:00,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00" (1/1) ... [2019-10-22 08:56:00,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:00,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:00,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:00,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:00,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/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 08:56:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:00,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:00,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:00,952 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:00,952 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-22 08:56:00,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:00 BoogieIcfgContainer [2019-10-22 08:56:00,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:00,954 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:00,954 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:00,958 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:00,961 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:00,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:00" (1/3) ... [2019-10-22 08:56:00,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48fbd268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:00, skipping insertion in model container [2019-10-22 08:56:00,962 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:00,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:00" (2/3) ... [2019-10-22 08:56:00,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48fbd268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:00, skipping insertion in model container [2019-10-22 08:56:00,963 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:00,963 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:00" (3/3) ... [2019-10-22 08:56:00,964 INFO L371 chiAutomizerObserver]: Analyzing ICFG array15_alloca.i [2019-10-22 08:56:01,012 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:01,012 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:01,012 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:01,012 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:01,012 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:01,013 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:01,013 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:01,013 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:01,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:56:01,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:56:01,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:01,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:01,052 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:01,052 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:56:01,052 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:01,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:56:01,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:56:01,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:01,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:01,054 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:01,054 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:56:01,060 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2019-10-22 08:56:01,060 INFO L793 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume main_#t~mem209 < 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2019-10-22 08:56:01,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:01,065 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-10-22 08:56:01,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:01,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868382723] [2019-10-22 08:56:01,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:01,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:01,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:01,167 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-10-22 08:56:01,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:01,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681028820] [2019-10-22 08:56:01,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:01,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:01,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:01,190 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:01,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:01,192 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-10-22 08:56:01,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:01,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125259859] [2019-10-22 08:56:01,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:01,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:01,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:01,227 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:01,461 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-10-22 08:56:01,524 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:01,524 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:01,525 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:01,525 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:01,525 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:01,525 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:01,525 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:01,525 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:01,525 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration1_Lasso [2019-10-22 08:56:01,526 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:01,526 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:01,556 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 08:56:01,563 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 08:56:01,566 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 08:56:01,569 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 08:56:01,571 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 08:56:01,588 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 08:56:01,590 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 08:56:01,593 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 08:56:01,600 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 08:56:01,604 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 08:56:01,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:01,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:01,946 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:01,951 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:01,953 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 08:56:01,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:01,955 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:01,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:01,956 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:01,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:01,959 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:01,959 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:01,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:01,963 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 08:56:01,963 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:01,964 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:01,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:01,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:01,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:01,965 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:01,965 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:01,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:01,967 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 08:56:01,967 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:01,967 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:01,968 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:01,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:01,968 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:01,969 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:01,969 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:01,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:01,970 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 08:56:01,971 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:01,971 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:01,971 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:01,972 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:01,972 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:01,973 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:01,973 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:01,974 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:01,974 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 08:56:01,975 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:01,975 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:01,975 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:01,975 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:01,978 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:01,978 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:01,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:01,983 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 08:56:01,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:01,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:01,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:01,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:01,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:01,984 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:01,984 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:01,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:01,985 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 08:56:01,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:01,986 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:01,986 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:01,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:01,986 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:01,987 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:01,987 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:01,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:01,989 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 08:56:01,989 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:01,989 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:01,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:01,990 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:01,990 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:01,990 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:01,990 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:01,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:01,991 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 08:56:01,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:01,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:01,993 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:01,993 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:01,994 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:01,994 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:01,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:01,999 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 08:56:01,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:02,000 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:02,000 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:02,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:02,004 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:02,005 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:02,054 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:02,077 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:56:02,078 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:56:02,080 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:02,081 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:02,082 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:02,082 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-10-22 08:56:02,091 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:56:02,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:56:02,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:02,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:02,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:02,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:02,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:02,176 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 08:56:02,191 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 08:56:02,192 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-10-22 08:56:02,245 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2019-10-22 08:56:02,245 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 08:56:02,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-10-22 08:56:02,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2019-10-22 08:56:02,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:02,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 08:56:02,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:02,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2019-10-22 08:56:02,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:02,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2019-10-22 08:56:02,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:02,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2019-10-22 08:56:02,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:56:02,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:56:02,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-10-22 08:56:02,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:02,263 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-10-22 08:56:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-10-22 08:56:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-22 08:56:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 08:56:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-10-22 08:56:02,293 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-10-22 08:56:02,293 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-10-22 08:56:02,293 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:02,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-10-22 08:56:02,294 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:02,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:02,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:02,295 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:02,295 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:02,296 INFO L791 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 114#L367 assume !(main_~length~0 < 1); 121#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2019-10-22 08:56:02,297 INFO L793 eck$LassoCheckResult]: Loop: 118#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 120#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 118#L378-2 [2019-10-22 08:56:02,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:02,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-10-22 08:56:02,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:02,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695315011] [2019-10-22 08:56:02,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:02,379 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 08:56:02,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695315011] [2019-10-22 08:56:02,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:02,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:02,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422898189] [2019-10-22 08:56:02,383 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:02,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:02,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-10-22 08:56:02,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:02,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557948556] [2019-10-22 08:56:02,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:02,409 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:02,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:02,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:02,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:02,462 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 08:56:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:02,498 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-10-22 08:56:02,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:02,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-10-22 08:56:02,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:02,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 08:56:02,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:56:02,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:56:02,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-10-22 08:56:02,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:02,502 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:56:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-10-22 08:56:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-10-22 08:56:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 08:56:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-10-22 08:56:02,504 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 08:56:02,504 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 08:56:02,504 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:02,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-10-22 08:56:02,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:02,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:02,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:02,505 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:02,506 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:02,506 INFO L791 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 147#L367 assume !(main_~length~0 < 1); 154#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 148#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2019-10-22 08:56:02,506 INFO L793 eck$LassoCheckResult]: Loop: 151#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 153#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 151#L378-2 [2019-10-22 08:56:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-10-22 08:56:02,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:02,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180382956] [2019-10-22 08:56:02,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:02,530 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-10-22 08:56:02,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:02,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828883284] [2019-10-22 08:56:02,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:02,542 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:02,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:02,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-10-22 08:56:02,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:02,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492060726] [2019-10-22 08:56:02,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:02,570 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:02,746 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-10-22 08:56:02,810 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:02,811 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:02,811 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:02,811 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:02,811 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:02,811 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:02,811 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:02,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:02,812 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration3_Lasso [2019-10-22 08:56:02,812 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:02,812 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:02,815 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 08:56:02,817 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 08:56:02,820 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 08:56:02,955 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 08:56:02,958 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 08:56:02,961 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 08:56:02,963 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 08:56:02,965 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 08:56:02,967 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 08:56:02,969 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 08:56:02,971 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 08:56:02,974 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 08:56:03,237 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:03,238 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:03,238 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 08:56:03,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:03,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:03,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:03,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:03,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:03,242 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:03,242 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:03,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:03,243 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 08:56:03,244 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:03,250 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:03,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:03,251 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:03,251 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:03,251 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:03,251 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:03,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:03,252 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 08:56:03,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:03,253 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:56:03,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:03,253 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:03,255 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:56:03,255 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:03,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:03,281 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 08:56:03,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:03,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:03,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:03,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:03,284 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:03,284 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:03,286 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:03,286 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 08:56:03,287 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:03,287 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:03,287 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:03,287 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:03,297 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:03,298 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:03,342 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:03,391 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:56:03,392 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:56:03,395 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:03,396 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:03,396 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:03,397 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-10-22 08:56:03,403 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:56:03,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:03,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:03,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:03,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:03,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:03,440 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 08:56:03,440 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 08:56:03,440 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:56:03,452 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2019-10-22 08:56:03,453 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 08:56:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-10-22 08:56:03,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-10-22 08:56:03,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:03,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-10-22 08:56:03,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:03,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-10-22 08:56:03,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:03,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-10-22 08:56:03,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:03,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-10-22 08:56:03,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:56:03,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:03,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-10-22 08:56:03,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:03,456 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 08:56:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-10-22 08:56:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 08:56:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:56:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-10-22 08:56:03,458 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 08:56:03,458 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 08:56:03,458 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:03,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-10-22 08:56:03,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:03,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:03,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:03,459 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:03,459 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:03,460 INFO L791 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 246#L367 assume !(main_~length~0 < 1); 255#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 243#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 254#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 250#L378-2 [2019-10-22 08:56:03,460 INFO L793 eck$LassoCheckResult]: Loop: 250#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 251#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 250#L378-2 [2019-10-22 08:56:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:03,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-10-22 08:56:03,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:03,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884059398] [2019-10-22 08:56:03,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:03,479 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:03,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:03,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-10-22 08:56:03,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:03,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080040399] [2019-10-22 08:56:03,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:03,487 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:03,487 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-10-22 08:56:03,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:03,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474381903] [2019-10-22 08:56:03,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:03,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474381903] [2019-10-22 08:56:03,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348302604] [2019-10-22 08:56:03,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/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 08:56:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:03,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:03,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:03,704 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:03,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-10-22 08:56:03,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965048242] [2019-10-22 08:56:03,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:03,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:56:03,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:56:03,737 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-10-22 08:56:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:03,897 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-10-22 08:56:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:56:03,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2019-10-22 08:56:03,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:03,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 28 transitions. [2019-10-22 08:56:03,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:03,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:03,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-10-22 08:56:03,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:03,899 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-22 08:56:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-10-22 08:56:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-10-22 08:56:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:56:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-10-22 08:56:03,901 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-10-22 08:56:03,901 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-10-22 08:56:03,901 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:56:03,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-10-22 08:56:03,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:03,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:03,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:03,902 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:03,902 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:03,903 INFO L791 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 360#L367 assume !(main_~length~0 < 1); 369#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 370#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 371#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 374#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 372#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 373#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 357#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 358#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 375#L370-3 assume !(main_~i~0 < main_~length~0); 361#L370-4 main_~j~0 := 0; 362#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 368#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 364#L378-2 [2019-10-22 08:56:03,903 INFO L793 eck$LassoCheckResult]: Loop: 364#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 365#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 364#L378-2 [2019-10-22 08:56:03,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:03,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2019-10-22 08:56:03,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:03,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177673619] [2019-10-22 08:56:03,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:03,924 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:03,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:03,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-10-22 08:56:03,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:03,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564740402] [2019-10-22 08:56:03,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:03,930 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:03,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:03,931 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2019-10-22 08:56:03,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:03,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795496855] [2019-10-22 08:56:03,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:03,951 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:04,194 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-10-22 08:56:04,236 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:04,236 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:04,236 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:04,236 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:04,236 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:04,236 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:04,236 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:04,236 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:04,237 INFO L131 ssoRankerPreferences]: Filename of dumped script: array15_alloca.i_Iteration5_Lasso [2019-10-22 08:56:04,237 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:04,237 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:04,239 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 08:56:04,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 08:56:04,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 08:56:04,253 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 08:56:04,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 08:56:04,380 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 08:56:04,382 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 08:56:04,384 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 08:56:04,385 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 08:56:04,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 08:56:04,387 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 08:56:04,602 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:04,602 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:04,603 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 08:56:04,603 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:04,604 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:04,604 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:04,604 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:04,604 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:04,604 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:04,605 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:04,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:04,605 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 08:56:04,606 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:04,606 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:04,606 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:04,606 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:04,608 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:04,608 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:04,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:04,610 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 08:56:04,610 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:04,611 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:04,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:04,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:04,611 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:04,611 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:04,611 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:04,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:04,621 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 08:56:04,621 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:04,621 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:04,621 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:04,621 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:04,622 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:04,622 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:04,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:04,631 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 08:56:04,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:04,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:04,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:04,632 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:04,634 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:04,634 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:04,652 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:04,665 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:56:04,666 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:56:04,666 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:04,667 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:04,667 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:04,668 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-10-22 08:56:04,675 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:56:04,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:04,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:04,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:04,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:04,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:04,713 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 08:56:04,713 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 08:56:04,713 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:56:04,723 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 31 transitions. Complement of second has 5 states. [2019-10-22 08:56:04,724 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 08:56:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 08:56:04,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-10-22 08:56:04,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:04,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-10-22 08:56:04,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:04,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 08:56:04,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:04,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2019-10-22 08:56:04,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:04,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2019-10-22 08:56:04,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:56:04,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:56:04,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-10-22 08:56:04,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:04,727 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-10-22 08:56:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-10-22 08:56:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-22 08:56:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:56:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-10-22 08:56:04,730 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-10-22 08:56:04,730 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-10-22 08:56:04,730 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:56:04,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-10-22 08:56:04,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:04,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:04,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:04,731 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:04,731 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:04,731 INFO L791 eck$LassoCheckResult]: Stem: 493#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 487#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 488#L367 assume !(main_~length~0 < 1); 499#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 500#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 501#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 505#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 502#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 503#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 489#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 490#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 506#L370-3 assume !(main_~i~0 < main_~length~0); 491#L370-4 main_~j~0 := 0; 492#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 497#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 504#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 507#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 494#L378-2 [2019-10-22 08:56:04,732 INFO L793 eck$LassoCheckResult]: Loop: 494#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 495#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 494#L378-2 [2019-10-22 08:56:04,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:04,732 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2019-10-22 08:56:04,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:04,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956342316] [2019-10-22 08:56:04,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:04,752 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:04,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-10-22 08:56:04,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:04,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019540372] [2019-10-22 08:56:04,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:04,759 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:04,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:04,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2019-10-22 08:56:04,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:04,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416479333] [2019-10-22 08:56:04,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:04,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:04,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416479333] [2019-10-22 08:56:04,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207580899] [2019-10-22 08:56:04,876 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:04,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-22 08:56:04,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:04,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:56:04,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:04,976 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:04,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-10-22 08:56:04,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619197610] [2019-10-22 08:56:04,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:05,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-22 08:56:05,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-10-22 08:56:05,000 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 17 states. [2019-10-22 08:56:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:05,193 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-10-22 08:56:05,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:56:05,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-10-22 08:56:05,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 08:56:05,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2019-10-22 08:56:05,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-10-22 08:56:05,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-10-22 08:56:05,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2019-10-22 08:56:05,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:05,197 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2019-10-22 08:56:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2019-10-22 08:56:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-10-22 08:56:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 08:56:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-10-22 08:56:05,200 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-10-22 08:56:05,200 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-10-22 08:56:05,200 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:56:05,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2019-10-22 08:56:05,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:56:05,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:05,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:05,203 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:05,203 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-10-22 08:56:05,203 INFO L791 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 640#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 641#L367 assume !(main_~length~0 < 1); 652#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 653#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 654#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 659#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 662#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 660#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 661#L372 assume !(main_#t~mem209 < 0);havoc main_#t~mem209; 655#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 656#L370-3 assume !(main_~i~0 < main_~length~0); 644#L370-4 main_~j~0 := 0; 645#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 664#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 663#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 657#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 658#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 674#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 672#L378-2 [2019-10-22 08:56:05,204 INFO L793 eck$LassoCheckResult]: Loop: 672#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 669#L378 assume main_#t~mem210 > 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 670#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 675#L378 assume !(main_#t~mem210 > 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 672#L378-2 [2019-10-22 08:56:05,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:05,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2019-10-22 08:56:05,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:05,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404680629] [2019-10-22 08:56:05,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:05,223 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-10-22 08:56:05,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:05,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282936661] [2019-10-22 08:56:05,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:05,231 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:05,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:05,232 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2019-10-22 08:56:05,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:05,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112634381] [2019-10-22 08:56:05,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:05,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:05,255 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:05,618 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 106 [2019-10-22 08:56:05,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:56:05 BoogieIcfgContainer [2019-10-22 08:56:05,707 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:56:05,708 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:05,708 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:05,708 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:05,708 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:00" (3/4) ... [2019-10-22 08:56:05,719 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 08:56:05,808 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_44a22022-e2c5-4bdd-97ad-4dfa88eed2d8/bin/uautomizer/witness.graphml [2019-10-22 08:56:05,808 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:05,810 INFO L168 Benchmark]: Toolchain (without parser) took 5793.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 939.4 MB in the beginning and 982.6 MB in the end (delta: -43.2 MB). Peak memory consumption was 160.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:05,810 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:05,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:05,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:05,811 INFO L168 Benchmark]: Boogie Preprocessor took 23.44 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:05,812 INFO L168 Benchmark]: RCFGBuilder took 375.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:05,812 INFO L168 Benchmark]: BuchiAutomizer took 4753.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 984.7 MB in the end (delta: 115.7 MB). Peak memory consumption was 173.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:05,813 INFO L168 Benchmark]: Witness Printer took 100.54 ms. Allocated memory is still 1.2 GB. Free memory was 984.7 MB in the beginning and 982.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:05,815 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 499.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.44 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 375.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4753.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 984.7 MB in the end (delta: 115.7 MB). Peak memory consumption was 173.9 MB. Max. memory is 11.5 GB. * Witness Printer took 100.54 ms. Allocated memory is still 1.2 GB. Free memory was 984.7 MB in the beginning and 982.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 3.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 64 SDtfs, 166 SDslu, 76 SDs, 0 SdLazy, 215 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital129 mio100 ax100 hnf98 lsp93 ukn83 mio100 lsp61 div100 bol100 ite100 ukn100 eq163 hnf89 smp96 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, \result=0, NULL=0, arr=-1, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50273ea6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6878f8d8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64118176=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@6ef6f327=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64118176=-1, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@761b8841=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@3255213d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@141314fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@28389c=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L381] j++ [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ Loop: [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND TRUE arr[j] > 0 [L379] j-- [L377] COND TRUE 0 <= j && j < length [L378] EXPR arr[j] [L378] COND FALSE !(arr[j] > 0) [L381] j++ End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...