./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/count_up_and_down_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/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/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 94f95b6ef0a3c8650bd30cb1958ada590298bd1c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:12:35,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:12:35,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:12:35,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:12:35,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:12:35,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:12:35,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:12:35,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:12:35,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:12:35,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:12:35,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:12:35,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:12:35,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:12:35,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:12:35,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:12:35,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:12:35,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:12:35,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:12:35,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:12:35,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:12:35,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:12:35,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:12:35,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:12:35,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:12:35,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:12:35,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:12:35,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:12:35,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:12:35,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:12:35,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:12:35,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:12:35,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:12:35,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:12:35,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:12:35,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:12:35,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:12:35,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:12:35,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:12:35,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:12:35,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:12:35,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:12:35,278 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:12:35,293 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:12:35,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:12:35,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:12:35,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:12:35,295 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:12:35,295 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:12:35,295 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:12:35,295 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:12:35,295 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:12:35,296 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:12:35,296 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:12:35,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:12:35,296 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:12:35,296 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:12:35,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:12:35,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:12:35,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:12:35,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:12:35,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:12:35,298 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:12:35,298 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:12:35,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:12:35,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:12:35,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:12:35,299 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:12:35,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:12:35,299 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:12:35,299 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:12:35,300 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:12:35,300 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/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/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 -> 94f95b6ef0a3c8650bd30cb1958ada590298bd1c [2019-11-15 21:12:35,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:12:35,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:12:35,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:12:35,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:12:35,337 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:12:35,338 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/bin/uautomizer/../../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2019-11-15 21:12:35,392 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/bin/uautomizer/data/5565cd81f/e3a3eac978e54169b1b7c37b8c760310/FLAG88b4c897a [2019-11-15 21:12:35,891 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:12:35,891 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2019-11-15 21:12:35,901 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/bin/uautomizer/data/5565cd81f/e3a3eac978e54169b1b7c37b8c760310/FLAG88b4c897a [2019-11-15 21:12:36,360 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/bin/uautomizer/data/5565cd81f/e3a3eac978e54169b1b7c37b8c760310 [2019-11-15 21:12:36,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:12:36,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:12:36,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:12:36,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:12:36,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:12:36,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:12:36" (1/1) ... [2019-11-15 21:12:36,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75efb503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36, skipping insertion in model container [2019-11-15 21:12:36,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:12:36" (1/1) ... [2019-11-15 21:12:36,378 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:12:36,416 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:12:36,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:12:36,777 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:12:36,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:12:36,886 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:12:36,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36 WrapperNode [2019-11-15 21:12:36,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:12:36,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:12:36,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:12:36,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:12:36,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36" (1/1) ... [2019-11-15 21:12:36,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36" (1/1) ... [2019-11-15 21:12:36,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:12:36,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:12:36,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:12:36,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:12:36,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36" (1/1) ... [2019-11-15 21:12:36,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36" (1/1) ... [2019-11-15 21:12:36,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36" (1/1) ... [2019-11-15 21:12:36,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36" (1/1) ... [2019-11-15 21:12:36,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36" (1/1) ... [2019-11-15 21:12:36,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36" (1/1) ... [2019-11-15 21:12:36,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36" (1/1) ... [2019-11-15 21:12:36,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:12:36,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:12:36,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:12:36,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:12:36,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/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-11-15 21:12:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:12:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:12:37,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:12:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:12:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:12:37,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:12:37,209 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:12:37,209 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:12:37,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:12:37 BoogieIcfgContainer [2019-11-15 21:12:37,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:12:37,211 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:12:37,211 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:12:37,214 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:12:37,214 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:12:37,214 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:12:36" (1/3) ... [2019-11-15 21:12:37,215 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@383979b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:12:37, skipping insertion in model container [2019-11-15 21:12:37,215 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:12:37,216 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:12:36" (2/3) ... [2019-11-15 21:12:37,216 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@383979b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:12:37, skipping insertion in model container [2019-11-15 21:12:37,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:12:37,216 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:12:37" (3/3) ... [2019-11-15 21:12:37,218 INFO L371 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca.i [2019-11-15 21:12:37,257 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:12:37,257 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:12:37,257 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:12:37,258 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:12:37,258 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:12:37,258 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:12:37,258 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:12:37,258 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:12:37,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 21:12:37,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:12:37,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:12:37,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:12:37,295 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:12:37,295 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:12:37,296 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:12:37,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 21:12:37,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:12:37,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:12:37,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:12:37,298 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:12:37,298 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:12:37,305 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, 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; 17#L367true assume !(main_~length~0 < 1); 3#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);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 15#L371-3true [2019-11-15 21:12:37,305 INFO L793 eck$LassoCheckResult]: Loop: 15#L371-3true assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 13#L371-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L371-3true [2019-11-15 21:12:37,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-15 21:12:37,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:37,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040773873] [2019-11-15 21:12:37,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:37,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:37,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:37,440 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:12:37,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-11-15 21:12:37,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:37,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080798686] [2019-11-15 21:12:37,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:37,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:37,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:37,461 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:12:37,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:37,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-11-15 21:12:37,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:37,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929718124] [2019-11-15 21:12:37,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:37,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:37,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:37,505 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:12:37,726 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-11-15 21:12:37,785 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:12:37,787 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:12:37,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:12:37,788 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:12:37,788 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:12:37,788 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:12:37,788 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:12:37,788 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:12:37,789 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration1_Lasso [2019-11-15 21:12:37,789 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:12:37,789 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:12:37,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:37,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:37,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:37,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:37,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:38,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:38,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:38,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:38,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:38,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:38,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:38,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:38,341 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:12:38,344 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:12:38,346 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-11-15 21:12:38,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:38,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:38,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:38,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:38,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:38,349 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:38,349 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:38,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:38,352 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-11-15 21:12:38,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:38,352 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:38,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:38,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:38,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:38,353 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:38,354 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:38,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:38,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:12:38,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:38,356 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:38,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:38,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:38,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:38,357 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:38,357 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:38,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:38,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:12:38,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:38,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:38,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:38,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:38,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:38,360 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:38,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:38,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:38,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:12:38,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:38,362 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:38,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:38,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:38,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:38,363 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:38,363 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:38,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:38,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:12:38,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:38,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:38,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:38,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:38,370 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:12:38,370 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:12:38,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:38,392 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-11-15 21:12:38,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:38,393 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:12:38,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:38,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:38,397 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:12:38,397 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:12:38,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:38,417 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-11-15 21:12:38,418 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:38,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:38,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:38,419 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:38,423 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:12:38,424 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:12:38,548 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:12:38,596 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 21:12:38,596 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 21:12:38,598 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:12:38,601 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:12:38,601 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:12:38,602 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-15 21:12:38,614 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 21:12:38,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:38,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:12:38,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:38,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:12:38,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:38,711 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-11-15 21:12:38,712 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2019-11-15 21:12:38,769 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 39 states and 54 transitions. Complement of second has 7 states. [2019-11-15 21:12:38,770 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-11-15 21:12:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:12:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-11-15 21:12:38,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 21:12:38,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:12:38,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 21:12:38,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:12:38,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 21:12:38,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:12:38,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 54 transitions. [2019-11-15 21:12:38,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:12:38,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 13 states and 17 transitions. [2019-11-15 21:12:38,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 21:12:38,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:12:38,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-15 21:12:38,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:12:38,786 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 21:12:38,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-15 21:12:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 21:12:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 21:12:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 21:12:38,815 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 21:12:38,815 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 21:12:38,816 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:12:38,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 21:12:38,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:12:38,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:12:38,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:12:38,818 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:38,818 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:12:38,819 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 119#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, 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; 120#L367 assume !(main_~length~0 < 1); 126#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; 127#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 128#L371-3 assume !(main_~i~0 < main_~length~0); 131#L371-4 main_~j~0 := 0; 124#L374-3 [2019-11-15 21:12:38,819 INFO L793 eck$LassoCheckResult]: Loop: 124#L374-3 assume !!(main_~j~0 < main_~length~0); 121#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 122#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 123#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 124#L374-3 [2019-11-15 21:12:38,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:38,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2019-11-15 21:12:38,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:38,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806913968] [2019-11-15 21:12:38,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:38,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:38,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:38,871 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:12:38,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:38,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2036812, now seen corresponding path program 1 times [2019-11-15 21:12:38,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:38,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141784593] [2019-11-15 21:12:38,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:38,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:38,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:38,898 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:12:38,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:38,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1386095268, now seen corresponding path program 1 times [2019-11-15 21:12:38,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:38,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855839031] [2019-11-15 21:12:38,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:38,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:38,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:38,942 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:12:39,102 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-15 21:12:39,155 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:12:39,155 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:12:39,155 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:12:39,155 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:12:39,156 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:12:39,156 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:12:39,156 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:12:39,156 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:12:39,156 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration2_Lasso [2019-11-15 21:12:39,156 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:12:39,157 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:12:39,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:39,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:39,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:39,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:39,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:39,312 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-11-15 21:12:39,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:39,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:39,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:39,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:39,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:39,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:39,656 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:12:39,656 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:12:39,656 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-11-15 21:12:39,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:39,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:39,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:39,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:39,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:39,658 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:39,658 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:39,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:39,659 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-11-15 21:12:39,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:39,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:39,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:39,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:39,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:39,660 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:39,661 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:39,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:39,661 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-11-15 21:12:39,662 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:39,662 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:39,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:39,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:39,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:39,663 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:39,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:39,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:39,664 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-11-15 21:12:39,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:39,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:39,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:39,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:39,667 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:12:39,667 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:12:39,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:39,669 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-11-15 21:12:39,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:39,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:39,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:39,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:39,675 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:12:39,677 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:12:39,727 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:12:39,801 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 21:12:39,802 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-11-15 21:12:39,804 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:12:39,805 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:12:39,805 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:12:39,805 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-15 21:12:39,817 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 21:12:39,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:39,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:12:39,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:39,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:12:39,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:39,864 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-11-15 21:12:39,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 21:12:39,879 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 18 states and 24 transitions. Complement of second has 4 states. [2019-11-15 21:12:39,879 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-11-15 21:12:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:12:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-15 21:12:39,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 21:12:39,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:12:39,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-15 21:12:39,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:12:39,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2019-11-15 21:12:39,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:12:39,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-11-15 21:12:39,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:12:39,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2019-11-15 21:12:39,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 21:12:39,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:12:39,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-11-15 21:12:39,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:12:39,884 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 21:12:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-11-15 21:12:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-15 21:12:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 21:12:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-15 21:12:39,885 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 21:12:39,886 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 21:12:39,886 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:12:39,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-15 21:12:39,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:12:39,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:12:39,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:12:39,888 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:39,888 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:12:39,888 INFO L791 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 221#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, 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; 222#L367 assume !(main_~length~0 < 1); 225#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; 226#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 227#L371-3 assume !(main_~i~0 < main_~length~0); 230#L371-4 main_~j~0 := 0; 223#L374-3 assume !!(main_~j~0 < main_~length~0); 215#L375-3 [2019-11-15 21:12:39,888 INFO L793 eck$LassoCheckResult]: Loop: 215#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 216#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem211;havoc main_#t~post212; 215#L375-3 [2019-11-15 21:12:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash 176705843, now seen corresponding path program 1 times [2019-11-15 21:12:39,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:39,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542601333] [2019-11-15 21:12:39,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:39,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:39,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:39,910 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:12:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 1 times [2019-11-15 21:12:39,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:39,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862098368] [2019-11-15 21:12:39,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:39,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:39,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:39,926 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:12:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:39,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1984375400, now seen corresponding path program 1 times [2019-11-15 21:12:39,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:39,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83923344] [2019-11-15 21:12:39,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:39,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:39,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:40,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83923344] [2019-11-15 21:12:40,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:12:40,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:12:40,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966939029] [2019-11-15 21:12:40,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:40,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:12:40,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:12:40,085 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-11-15 21:12:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:40,139 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-11-15 21:12:40,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:12:40,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-11-15 21:12:40,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:12:40,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2019-11-15 21:12:40,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 21:12:40,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 21:12:40,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2019-11-15 21:12:40,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:12:40,142 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-15 21:12:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2019-11-15 21:12:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2019-11-15 21:12:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 21:12:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-11-15 21:12:40,144 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-15 21:12:40,144 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-15 21:12:40,144 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:12:40,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2019-11-15 21:12:40,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:12:40,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:12:40,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:12:40,145 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:40,145 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:12:40,145 INFO L791 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 277#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, 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; 278#L367 assume !(main_~length~0 < 1); 282#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; 283#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 284#L371-3 assume !(main_~i~0 < main_~length~0); 287#L371-4 main_~j~0 := 0; 279#L374-3 assume !!(main_~j~0 < main_~length~0); 275#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 276#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 271#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 272#L374-3 assume !!(main_~j~0 < main_~length~0); 273#L375-3 [2019-11-15 21:12:40,145 INFO L793 eck$LassoCheckResult]: Loop: 273#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 274#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem211;havoc main_#t~post212; 273#L375-3 [2019-11-15 21:12:40,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:40,146 INFO L82 PathProgramCache]: Analyzing trace with hash -19280312, now seen corresponding path program 2 times [2019-11-15 21:12:40,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:40,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899373790] [2019-11-15 21:12:40,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:40,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:40,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:40,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899373790] [2019-11-15 21:12:40,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950756049] [2019-11-15 21:12:40,197 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b384b3c0-51b3-48eb-a91b-9946e91ece1b/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-11-15 21:12:40,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:12:40,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:12:40,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:12:40,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:40,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:12:40,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-11-15 21:12:40,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933640745] [2019-11-15 21:12:40,317 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:12:40,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:40,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 2 times [2019-11-15 21:12:40,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:40,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029478024] [2019-11-15 21:12:40,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:40,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:40,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:40,323 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:12:40,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:12:40,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:12:40,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:12:40,360 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-15 21:12:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:12:40,450 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-11-15 21:12:40,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:12:40,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2019-11-15 21:12:40,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:12:40,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 19 states and 22 transitions. [2019-11-15 21:12:40,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 21:12:40,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 21:12:40,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2019-11-15 21:12:40,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:12:40,453 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-15 21:12:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2019-11-15 21:12:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-15 21:12:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 21:12:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-15 21:12:40,456 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 21:12:40,456 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-15 21:12:40,456 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:12:40,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2019-11-15 21:12:40,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:12:40,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:12:40,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:12:40,457 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:12:40,457 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:12:40,457 INFO L791 eck$LassoCheckResult]: Stem: 388#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 382#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, 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; 383#L367 assume !(main_~length~0 < 1); 389#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; 390#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 393#L371-3 assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 391#L371-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 392#L371-3 assume !(main_~i~0 < main_~length~0); 395#L371-4 main_~j~0 := 0; 386#L374-3 assume !!(main_~j~0 < main_~length~0); 387#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 394#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 384#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 385#L374-3 assume !!(main_~j~0 < main_~length~0); 378#L375-3 [2019-11-15 21:12:40,458 INFO L793 eck$LassoCheckResult]: Loop: 378#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 379#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem211;havoc main_#t~post212; 378#L375-3 [2019-11-15 21:12:40,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:40,458 INFO L82 PathProgramCache]: Analyzing trace with hash -744742010, now seen corresponding path program 1 times [2019-11-15 21:12:40,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:40,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283559425] [2019-11-15 21:12:40,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:40,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:40,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:40,505 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:12:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 3 times [2019-11-15 21:12:40,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:40,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267771172] [2019-11-15 21:12:40,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:40,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:40,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:40,522 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:12:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:40,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1562468139, now seen corresponding path program 1 times [2019-11-15 21:12:40,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:12:40,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743745233] [2019-11-15 21:12:40,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:40,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:12:40,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:12:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:12:40,558 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:12:40,869 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-11-15 21:12:40,934 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:12:40,934 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:12:40,934 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:12:40,934 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:12:40,934 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:12:40,935 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:12:40,935 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:12:40,935 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:12:40,935 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration5_Lasso [2019-11-15 21:12:40,935 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:12:40,935 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:12:40,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:40,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:40,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:40,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:40,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:40,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:40,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:41,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:41,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:41,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:41,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:12:41,372 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:12:41,372 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:12:41,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:12:41,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:41,373 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:41,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:41,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:41,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:41,374 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:41,374 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:41,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:41,375 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-11-15 21:12:41,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:41,375 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:41,375 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:41,375 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:41,375 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:41,376 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:41,376 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:41,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:41,376 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-11-15 21:12:41,377 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:41,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:41,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:41,383 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:41,398 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:12:41,398 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:12:41,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:41,400 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-11-15 21:12:41,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:41,400 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:41,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:41,401 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:41,401 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:41,401 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:41,401 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:41,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:41,402 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-11-15 21:12:41,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:41,403 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:41,403 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:41,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:41,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:41,404 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:41,404 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:41,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:41,405 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-11-15 21:12:41,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:41,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:41,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:41,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:41,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:41,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:41,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:41,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:41,407 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-11-15 21:12:41,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:41,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:41,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:41,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:41,409 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:12:41,409 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:12:41,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:41,411 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-11-15 21:12:41,412 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:41,412 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:12:41,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:41,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:41,414 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:12:41,414 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:12:41,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:12:41,422 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-11-15 21:12:41,424 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:12:41,424 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:12:41,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:12:41,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:12:41,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:12:41,425 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:12:41,425 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:12:41,426 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:12:41,427 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:12:41,428 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:12:41,428 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:12:41,428 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:12:41,428 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:12:41,429 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2019-11-15 21:12:41,439 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-15 21:12:41,441 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:12:41,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:41,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:12:41,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:41,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:12:41,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:41,500 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:12:41,500 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 21:12:41,522 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2019-11-15 21:12:41,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:12:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:12:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 21:12:41,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-15 21:12:41,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:12:41,524 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:12:41,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:41,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:12:41,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:41,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:12:41,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:41,583 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:12:41,583 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 21:12:41,594 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2019-11-15 21:12:41,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:12:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:12:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 21:12:41,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-15 21:12:41,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:12:41,596 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:12:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:12:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:41,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:12:41,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:12:41,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:12:41,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:12:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:12:41,650 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:12:41,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 21:12:41,674 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 23 states and 28 transitions. Complement of second has 6 states. [2019-11-15 21:12:41,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:12:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:12:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-15 21:12:41,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-15 21:12:41,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:12:41,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-15 21:12:41,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:12:41,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-15 21:12:41,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:12:41,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2019-11-15 21:12:41,677 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:12:41,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2019-11-15 21:12:41,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:12:41,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:12:41,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:12:41,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:12:41,678 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:12:41,678 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:12:41,678 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:12:41,678 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:12:41,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:12:41,678 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:12:41,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:12:41,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:12:41 BoogieIcfgContainer [2019-11-15 21:12:41,684 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:12:41,684 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:12:41,684 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:12:41,684 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:12:41,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:12:37" (3/4) ... [2019-11-15 21:12:41,688 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:12:41,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:12:41,689 INFO L168 Benchmark]: Toolchain (without parser) took 5325.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -209.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:12:41,690 INFO L168 Benchmark]: CDTParser took 2.80 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:12:41,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:12:41,691 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.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-11-15 21:12:41,692 INFO L168 Benchmark]: Boogie Preprocessor took 22.43 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-11-15 21:12:41,692 INFO L168 Benchmark]: RCFGBuilder took 261.07 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-11-15 21:12:41,693 INFO L168 Benchmark]: BuchiAutomizer took 4473.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -55.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:12:41,693 INFO L168 Benchmark]: Witness Printer took 3.99 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-11-15 21:12:41,696 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.80 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 521.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.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 22.43 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 261.07 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 4473.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -55.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.99 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 78 SDtfs, 108 SDslu, 51 SDs, 0 SdLazy, 108 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital144 mio100 ax100 hnf99 lsp95 ukn78 mio100 lsp60 div100 bol100 ite100 ukn100 eq157 hnf87 smp93 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms 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: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...