./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/count_up_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_7e369106-f88a-42f0-85ff-c3bc3e5c9062/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/count_up_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/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 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:36:22,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:36:22,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:36:22,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:36:22,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:36:22,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:36:22,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:36:22,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:36:22,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:36:22,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:36:22,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:36:22,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:36:22,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:36:22,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:36:22,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:36:22,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:36:22,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:36:22,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:36:22,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:36:22,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:36:22,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:36:22,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:36:22,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:36:22,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:36:22,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:36:22,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:36:22,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:36:22,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:36:22,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:36:22,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:36:22,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:36:22,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:36:22,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:36:22,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:36:22,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:36:22,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:36:22,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:36:22,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:36:22,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:36:22,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:36:22,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:36:22,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:36:22,484 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:36:22,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:36:22,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:36:22,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:36:22,496 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:36:22,496 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:36:22,496 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:36:22,497 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:36:22,497 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:36:22,497 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:36:22,497 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:36:22,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:36:22,498 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:36:22,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:36:22,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:36:22,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:36:22,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:36:22,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:36:22,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:36:22,500 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:36:22,501 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:36:22,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:36:22,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:36:22,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:36:22,502 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:36:22,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:36:22,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:36:22,502 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:36:22,504 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:36:22,506 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_7e369106-f88a-42f0-85ff-c3bc3e5c9062/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 -> 09e9c2546f4b38561ae63bf5b67ae3d7f5a4eb9b [2019-11-16 00:36:22,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:36:22,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:36:22,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:36:22,551 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:36:22,552 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:36:22,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/bin/uautomizer/../../sv-benchmarks/c/termination-15/count_up_alloca.i [2019-11-16 00:36:22,610 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/bin/uautomizer/data/6fe89dc72/373c989e3eba451388e5008c79220a71/FLAG6731d2b21 [2019-11-16 00:36:23,050 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:36:23,050 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/sv-benchmarks/c/termination-15/count_up_alloca.i [2019-11-16 00:36:23,060 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/bin/uautomizer/data/6fe89dc72/373c989e3eba451388e5008c79220a71/FLAG6731d2b21 [2019-11-16 00:36:23,345 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/bin/uautomizer/data/6fe89dc72/373c989e3eba451388e5008c79220a71 [2019-11-16 00:36:23,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:36:23,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:36:23,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:36:23,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:36:23,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:36:23,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:36:23" (1/1) ... [2019-11-16 00:36:23,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375ff64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23, skipping insertion in model container [2019-11-16 00:36:23,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:36:23" (1/1) ... [2019-11-16 00:36:23,366 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:36:23,420 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:36:23,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:36:23,793 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:36:23,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:36:23,891 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:36:23,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23 WrapperNode [2019-11-16 00:36:23,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:36:23,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:36:23,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:36:23,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:36:23,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23" (1/1) ... [2019-11-16 00:36:23,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23" (1/1) ... [2019-11-16 00:36:23,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:36:23,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:36:23,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:36:23,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:36:23,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23" (1/1) ... [2019-11-16 00:36:23,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23" (1/1) ... [2019-11-16 00:36:23,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23" (1/1) ... [2019-11-16 00:36:23,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23" (1/1) ... [2019-11-16 00:36:23,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23" (1/1) ... [2019-11-16 00:36:23,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23" (1/1) ... [2019-11-16 00:36:23,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23" (1/1) ... [2019-11-16 00:36:23,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:36:23,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:36:23,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:36:23,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:36:23,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/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-16 00:36:24,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:36:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:36:24,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:36:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:36:24,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:36:24,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:36:24,377 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:36:24,377 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:36:24,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:36:24 BoogieIcfgContainer [2019-11-16 00:36:24,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:36:24,379 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:36:24,379 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:36:24,383 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:36:24,384 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:36:24,384 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:36:23" (1/3) ... [2019-11-16 00:36:24,385 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@618246f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:36:24, skipping insertion in model container [2019-11-16 00:36:24,385 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:36:24,385 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:23" (2/3) ... [2019-11-16 00:36:24,385 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@618246f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:36:24, skipping insertion in model container [2019-11-16 00:36:24,386 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:36:24,386 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:36:24" (3/3) ... [2019-11-16 00:36:24,387 INFO L371 chiAutomizerObserver]: Analyzing ICFG count_up_alloca.i [2019-11-16 00:36:24,429 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:36:24,429 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:36:24,429 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:36:24,429 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:36:24,430 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:36:24,430 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:36:24,430 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:36:24,430 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:36:24,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-16 00:36:24,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-16 00:36:24,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:24,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:24,471 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:36:24,472 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:36:24,472 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:36:24,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-16 00:36:24,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-16 00:36:24,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:24,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:24,474 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:36:24,474 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:36:24,482 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 15#L369true assume !(main_~length~0 < 1); 20#L369-2true call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 12#L371true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 16#L372-3true [2019-11-16 00:36:24,482 INFO L793 eck$LassoCheckResult]: Loop: 16#L372-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 7#L374true assume main_~val~0 > main_~limit~0;main_~val~0 := main_~limit~0; 10#L374-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 13#L372-2true main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 16#L372-3true [2019-11-16 00:36:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:24,487 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-16 00:36:24,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:24,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418488996] [2019-11-16 00:36:24,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:24,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:24,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:24,599 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:24,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-11-16 00:36:24,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:24,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231927038] [2019-11-16 00:36:24,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:24,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:24,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:24,621 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:24,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:24,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2019-11-16 00:36:24,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:24,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718388196] [2019-11-16 00:36:24,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:24,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:24,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:24,663 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:24,889 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-11-16 00:36:24,999 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-16 00:36:25,019 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:36:25,019 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:36:25,020 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:36:25,020 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:36:25,020 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:36:25,020 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:36:25,020 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:36:25,020 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:36:25,021 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration1_Lasso [2019-11-16 00:36:25,021 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:36:25,021 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:36:25,043 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-16 00:36:25,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:25,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-16 00:36:25,055 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-16 00:36:25,057 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-16 00:36:25,061 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-16 00:36:25,064 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-16 00:36:25,066 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-16 00:36:25,069 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-16 00:36:25,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:25,083 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-16 00:36:25,088 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-16 00:36:25,519 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:36:25,523 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:36:25,525 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-16 00:36:25,527 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:25,527 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:25,528 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:25,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:25,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:25,530 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:25,531 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:25,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:25,534 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-16 00:36:25,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:25,535 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:25,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:25,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:25,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:25,536 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:25,536 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:25,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:25,538 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-16 00:36:25,539 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:25,539 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:25,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:25,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:25,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:25,540 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:25,540 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:25,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:25,541 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-16 00:36:25,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:25,542 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:25,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:25,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:25,543 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:25,543 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:25,543 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:25,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:25,545 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-16 00:36:25,545 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:25,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:25,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:25,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:25,549 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:25,549 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:25,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:25,554 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-16 00:36:25,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:25,555 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:25,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:25,556 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:25,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:25,556 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:25,556 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:25,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:25,558 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-16 00:36:25,558 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:25,559 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:25,559 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:25,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:25,559 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:25,560 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:25,560 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:25,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:25,561 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-16 00:36:25,562 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:25,562 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:25,562 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:25,562 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:25,562 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:25,563 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:25,563 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:25,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:25,564 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-16 00:36:25,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:25,565 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:25,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:25,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:25,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:25,570 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:25,570 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:25,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:25,573 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-16 00:36:25,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:25,575 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:25,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:25,576 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:25,576 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:25,580 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:25,580 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:25,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:25,596 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-16 00:36:25,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:25,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:25,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:25,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:25,598 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:25,599 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:25,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:25,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:25,603 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:25,604 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:25,604 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:25,604 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:25,609 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:25,609 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:25,747 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:36:25,812 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:36:25,813 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-16 00:36:25,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:36:25,828 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:36:25,829 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:36:25,829 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-16 00:36:25,843 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:36:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:25,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:25,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:25,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:36:25,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:25,931 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-16 00:36:25,949 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-16 00:36:25,950 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-11-16 00:36:26,015 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2019-11-16 00:36:26,016 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-16 00:36:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:36:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2019-11-16 00:36:26,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:36:26,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:26,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-16 00:36:26,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:26,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-16 00:36:26,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:26,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2019-11-16 00:36:26,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:26,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-11-16 00:36:26,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:36:26,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:36:26,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-16 00:36:26,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:36:26,034 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-16 00:36:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-16 00:36:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-16 00:36:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:36:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-16 00:36:26,062 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-16 00:36:26,062 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-16 00:36:26,063 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:36:26,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-16 00:36:26,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:26,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:26,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:26,064 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:26,065 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:36:26,065 INFO L791 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 134#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 135#L369 assume !(main_~length~0 < 1); 140#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 137#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L372-3 assume !(main_~i~0 < main_~length~0); 141#L372-4 main_~j~0 := 0; 130#L379-3 [2019-11-16 00:36:26,065 INFO L793 eck$LassoCheckResult]: Loop: 130#L379-3 assume !!(main_~j~0 < main_~length~0); 127#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 128#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 129#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 130#L379-3 [2019-11-16 00:36:26,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:26,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2019-11-16 00:36:26,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:26,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36527083] [2019-11-16 00:36:26,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:26,115 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-16 00:36:26,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36527083] [2019-11-16 00:36:26,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:26,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:36:26,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945215342] [2019-11-16 00:36:26,118 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:36:26,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2019-11-16 00:36:26,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:26,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540844366] [2019-11-16 00:36:26,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:26,136 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:26,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:36:26,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:36:26,186 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-16 00:36:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:26,228 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-16 00:36:26,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:36:26,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-16 00:36:26,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:26,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2019-11-16 00:36:26,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-16 00:36:26,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:36:26,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-11-16 00:36:26,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:36:26,233 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-16 00:36:26,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-11-16 00:36:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-11-16 00:36:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:36:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-16 00:36:26,235 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-16 00:36:26,235 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-16 00:36:26,235 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:36:26,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-16 00:36:26,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:26,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:26,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:26,237 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:26,237 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:36:26,237 INFO L791 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 175#L369 assume !(main_~length~0 < 1); 180#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 177#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 178#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 171#L374 assume !(main_~val~0 > main_~limit~0); 172#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 173#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 179#L372-3 assume !(main_~i~0 < main_~length~0); 181#L372-4 main_~j~0 := 0; 170#L379-3 [2019-11-16 00:36:26,238 INFO L793 eck$LassoCheckResult]: Loop: 170#L379-3 assume !!(main_~j~0 < main_~length~0); 167#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 168#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 169#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 170#L379-3 [2019-11-16 00:36:26,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:26,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2019-11-16 00:36:26,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:26,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728336436] [2019-11-16 00:36:26,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:26,291 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:26,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2019-11-16 00:36:26,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:26,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67517076] [2019-11-16 00:36:26,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:26,316 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:26,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:26,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2019-11-16 00:36:26,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:26,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012994250] [2019-11-16 00:36:26,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:26,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:26,358 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:26,588 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-11-16 00:36:26,653 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:36:26,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:36:26,654 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:36:26,654 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:36:26,654 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:36:26,654 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:36:26,654 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:36:26,654 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:36:26,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration3_Lasso [2019-11-16 00:36:26,655 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:36:26,655 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:36:26,658 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-16 00:36:26,662 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-16 00:36:26,671 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-16 00:36:26,674 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-16 00:36:26,677 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-16 00:36:26,679 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-16 00:36:26,683 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-16 00:36:26,686 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-16 00:36:26,690 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-16 00:36:26,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:26,858 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-16 00:36:26,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:26,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:27,102 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:36:27,103 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:36:27,103 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-16 00:36:27,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:27,104 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:27,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:27,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:27,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:27,105 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:27,105 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:27,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:27,106 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-16 00:36:27,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:27,107 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:27,107 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:27,107 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:27,107 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:27,108 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:27,108 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:27,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:27,109 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-16 00:36:27,109 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:27,109 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:27,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:27,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:27,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:27,110 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:27,111 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:27,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:27,111 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-16 00:36:27,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:27,112 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:27,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:27,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:27,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:27,113 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:27,113 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:27,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:27,114 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-16 00:36:27,115 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:27,115 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:27,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:27,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:27,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:27,116 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:27,116 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:27,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:27,117 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-16 00:36:27,117 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:27,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:27,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:27,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:27,119 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:27,119 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:27,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:27,122 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-16 00:36:27,122 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:27,122 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:27,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:27,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:27,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:27,123 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:27,123 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:27,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:27,124 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-16 00:36:27,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:27,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:27,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:27,125 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:27,127 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:27,127 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:27,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:27,129 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-16 00:36:27,130 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:27,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:27,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:27,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:27,132 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:27,133 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:27,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:27,137 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-16 00:36:27,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:27,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:27,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:27,138 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:27,140 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:27,140 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:27,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:27,147 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-16 00:36:27,148 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:27,148 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:27,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:27,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:27,150 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:27,150 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:27,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:27,152 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-16 00:36:27,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:27,153 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:27,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:27,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:27,156 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:27,156 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:27,194 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:36:27,230 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:36:27,230 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:36:27,231 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:36:27,236 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:36:27,237 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:36:27,237 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-16 00:36:27,253 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:36:27,255 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:36:27,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:27,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:27,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:27,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:36:27,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:27,310 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-16 00:36:27,311 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-16 00:36:27,311 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-16 00:36:27,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 21 states and 27 transitions. Complement of second has 6 states. [2019-11-16 00:36:27,340 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-16 00:36:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:36:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-11-16 00:36:27,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-16 00:36:27,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:27,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-16 00:36:27,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:27,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-16 00:36:27,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:27,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-11-16 00:36:27,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:36:27,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2019-11-16 00:36:27,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:36:27,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:36:27,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-16 00:36:27,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:36:27,344 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-16 00:36:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-16 00:36:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-11-16 00:36:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:36:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-11-16 00:36:27,346 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-16 00:36:27,346 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-11-16 00:36:27,346 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:36:27,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-11-16 00:36:27,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:36:27,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:27,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:27,353 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:27,353 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:36:27,354 INFO L791 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 293#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 294#L369 assume !(main_~length~0 < 1); 300#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 295#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 296#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 290#L374 assume !(main_~val~0 > main_~limit~0); 291#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 292#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 298#L372-3 assume !(main_~i~0 < main_~length~0); 299#L372-4 main_~j~0 := 0; 289#L379-3 assume !!(main_~j~0 < main_~length~0); 283#L380-3 [2019-11-16 00:36:27,354 INFO L793 eck$LassoCheckResult]: Loop: 283#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 284#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem212;havoc main_#t~post213; 283#L380-3 [2019-11-16 00:36:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:27,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2019-11-16 00:36:27,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:27,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369575111] [2019-11-16 00:36:27,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:27,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:27,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:27,392 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:27,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-11-16 00:36:27,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:27,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667689873] [2019-11-16 00:36:27,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:27,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:27,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:27,412 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:27,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:27,413 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2019-11-16 00:36:27,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:27,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959255581] [2019-11-16 00:36:27,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:27,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:27,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:27,458 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:27,592 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-11-16 00:36:27,638 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:36:27,638 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:36:27,638 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:36:27,639 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:36:27,639 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:36:27,639 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:36:27,639 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:36:27,639 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:36:27,639 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration4_Lasso [2019-11-16 00:36:27,639 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:36:27,639 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:36:27,642 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-16 00:36:27,651 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-16 00:36:27,827 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-16 00:36:27,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-16 00:36:27,833 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-16 00:36:27,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:27,837 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-16 00:36:27,840 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-16 00:36:27,843 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-16 00:36:27,845 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-16 00:36:27,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:27,851 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-16 00:36:28,111 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:36:28,111 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:36:28,111 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-16 00:36:28,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:28,112 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:28,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:28,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:28,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:28,113 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:28,113 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:28,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:28,114 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-16 00:36:28,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:28,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:28,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:28,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:28,117 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:28,117 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:28,134 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:36:28,157 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:36:28,158 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:36:28,158 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:36:28,161 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:36:28,161 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:36:28,162 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, 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*ULTIMATE.start_main_~limit~0 - 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-16 00:36:28,183 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:36:28,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:36:28,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:28,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:28,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:28,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:36:28,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:28,271 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-16 00:36:28,271 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-16 00:36:28,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-16 00:36:28,311 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 27 states and 35 transitions. Complement of second has 7 states. [2019-11-16 00:36:28,312 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-16 00:36:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:36:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-16 00:36:28,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-16 00:36:28,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:28,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-16 00:36:28,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:28,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-16 00:36:28,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:28,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2019-11-16 00:36:28,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:36:28,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2019-11-16 00:36:28,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:36:28,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:36:28,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2019-11-16 00:36:28,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:36:28,317 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-11-16 00:36:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2019-11-16 00:36:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-16 00:36:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:36:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-11-16 00:36:28,323 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-16 00:36:28,323 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-16 00:36:28,323 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:36:28,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-11-16 00:36:28,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:36:28,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:28,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:28,328 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:28,328 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:36:28,329 INFO L791 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 420#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 421#L369 assume !(main_~length~0 < 1); 427#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 424#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 425#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 418#L374 assume !(main_~val~0 > main_~limit~0); 419#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 422#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 426#L372-3 assume !(main_~i~0 < main_~length~0); 428#L372-4 main_~j~0 := 0; 416#L379-3 assume !!(main_~j~0 < main_~length~0); 417#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 430#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 414#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 415#L379-3 assume !!(main_~j~0 < main_~length~0); 410#L380-3 [2019-11-16 00:36:28,330 INFO L793 eck$LassoCheckResult]: Loop: 410#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 411#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem212;havoc main_#t~post213; 410#L380-3 [2019-11-16 00:36:28,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:28,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2019-11-16 00:36:28,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:28,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190418090] [2019-11-16 00:36:28,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:28,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:28,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:28,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190418090] [2019-11-16 00:36:28,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006205562] [2019-11-16 00:36:28,482 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7e369106-f88a-42f0-85ff-c3bc3e5c9062/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-16 00:36:28,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:36:28,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:36:28,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:36:28,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:28,691 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:36:28,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-11-16 00:36:28,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918666598] [2019-11-16 00:36:28,692 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:36:28,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:28,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-11-16 00:36:28,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:28,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626932513] [2019-11-16 00:36:28,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:28,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:28,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:28,715 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:28,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:28,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:36:28,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:36:28,744 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand 14 states. [2019-11-16 00:36:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:29,083 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-11-16 00:36:29,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:36:29,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. [2019-11-16 00:36:29,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:36:29,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 28 states and 35 transitions. [2019-11-16 00:36:29,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:36:29,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:36:29,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-11-16 00:36:29,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:36:29,087 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-16 00:36:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-11-16 00:36:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-16 00:36:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-16 00:36:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-11-16 00:36:29,090 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-16 00:36:29,090 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-16 00:36:29,090 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:36:29,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2019-11-16 00:36:29,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:36:29,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:29,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:29,091 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:29,092 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:36:29,092 INFO L791 eck$LassoCheckResult]: Stem: 566#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 564#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~nondet206, main_#t~malloc207.base, main_#t~malloc207.offset, main_#t~nondet209, main_#t~post208, main_#t~mem212, main_#t~post213, main_#t~mem211, main_#t~post210, main_~i~0, main_~j~0, main_~val~0, main_~limit~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~limit~0 := main_#t~nondet205;havoc main_#t~nondet205;main_~length~0 := main_#t~nondet206;havoc main_#t~nondet206; 565#L369 assume !(main_~length~0 < 1); 572#L369-2 call main_#t~malloc207.base, main_#t~malloc207.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc207.base, main_#t~malloc207.offset; 567#L371 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 568#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 571#L374 assume !(main_~val~0 > main_~limit~0); 576#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 569#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 570#L372-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet209;havoc main_#t~nondet209; 561#L374 assume !(main_~val~0 > main_~limit~0); 562#L374-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 563#L372-2 main_#t~post208 := main_~i~0;main_~i~0 := 1 + main_#t~post208;havoc main_#t~post208; 575#L372-3 assume !(main_~i~0 < main_~length~0); 574#L372-4 main_~j~0 := 0; 559#L379-3 assume !!(main_~j~0 < main_~length~0); 560#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 577#L380-1 assume !(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211; 557#L379-2 main_#t~post210 := main_~j~0;main_~j~0 := 1 + main_#t~post210;havoc main_#t~post210; 558#L379-3 assume !!(main_~j~0 < main_~length~0); 553#L380-3 [2019-11-16 00:36:29,092 INFO L793 eck$LassoCheckResult]: Loop: 553#L380-3 call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 554#L380-1 assume !!(main_#t~mem211 < main_~limit~0);havoc main_#t~mem211;call main_#t~mem212 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post213 := main_#t~mem212;call write~int(1 + main_#t~post213, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem212;havoc main_#t~post213; 553#L380-3 [2019-11-16 00:36:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2019-11-16 00:36:29,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:29,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973952601] [2019-11-16 00:36:29,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:29,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:29,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:29,112 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:29,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:29,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2019-11-16 00:36:29,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:29,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711190720] [2019-11-16 00:36:29,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:29,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:29,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:29,124 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:29,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:29,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2019-11-16 00:36:29,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:29,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922479717] [2019-11-16 00:36:29,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:29,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:29,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:29,179 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:29,453 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 88 [2019-11-16 00:36:29,525 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:36:29,526 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:36:29,526 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:36:29,526 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:36:29,526 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:36:29,526 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:36:29,526 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:36:29,526 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:36:29,526 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_alloca.i_Iteration6_Lasso [2019-11-16 00:36:29,526 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:36:29,526 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:36:29,529 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-16 00:36:29,536 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-16 00:36:29,538 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-16 00:36:29,540 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-16 00:36:29,660 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-16 00:36:29,663 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-16 00:36:29,665 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-16 00:36:29,669 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-16 00:36:29,674 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-16 00:36:29,676 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-16 00:36:29,678 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-16 00:36:29,680 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-16 00:36:29,895 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:36:29,896 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:36:29,896 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-16 00:36:29,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:29,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:29,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:29,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:29,898 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:29,898 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:29,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:29,900 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-16 00:36:29,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:29,901 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:29,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:29,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:29,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:29,901 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:29,901 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:29,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:29,902 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-16 00:36:29,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:29,903 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:29,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:29,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:29,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:29,903 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:29,903 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:29,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:29,904 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-16 00:36:29,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:29,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:29,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:29,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:29,907 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:29,907 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:29,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:29,915 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-16 00:36:29,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:29,915 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:29,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:29,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:29,917 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:29,917 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:29,935 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:36:29,945 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:36:29,945 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:36:29,946 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:36:29,948 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:36:29,948 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:36:29,948 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~limit~0, v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_3) = 1*ULTIMATE.start_main_~limit~0 - 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))_3 Supporting invariants [] [2019-11-16 00:36:29,958 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:36:29,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:36:29,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:29,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:29,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:29,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:36:29,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:30,016 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-16 00:36:30,016 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-16 00:36:30,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-16 00:36:30,043 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-11-16 00:36:30,044 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-16 00:36:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:36:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-16 00:36:30,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-11-16 00:36:30,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:30,045 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:36:30,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:30,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:30,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:30,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:36:30,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:30,096 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-16 00:36:30,097 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-16 00:36:30,097 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-16 00:36:30,119 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2019-11-16 00:36:30,121 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-16 00:36:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:36:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-16 00:36:30,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2019-11-16 00:36:30,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:30,122 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:36:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:30,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:30,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:30,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:36:30,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:30,173 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-16 00:36:30,173 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-16 00:36:30,173 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-16 00:36:30,194 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2019-11-16 00:36:30,196 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-16 00:36:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:36:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-11-16 00:36:30,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2019-11-16 00:36:30,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:30,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2019-11-16 00:36:30,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:30,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2019-11-16 00:36:30,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:30,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2019-11-16 00:36:30,199 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:36:30,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2019-11-16 00:36:30,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:36:30,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:36:30,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:36:30,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:36:30,199 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:36:30,199 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:36:30,199 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:36:30,199 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:36:30,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:36:30,200 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:36:30,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:36:30,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:36:30 BoogieIcfgContainer [2019-11-16 00:36:30,205 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:36:30,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:36:30,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:36:30,206 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:36:30,206 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:36:24" (3/4) ... [2019-11-16 00:36:30,209 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:36:30,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:36:30,215 INFO L168 Benchmark]: Toolchain (without parser) took 6862.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 944.7 MB in the beginning and 979.7 MB in the end (delta: -35.0 MB). Peak memory consumption was 157.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:30,215 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:36:30,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 543.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:30,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.47 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-16 00:36:30,221 INFO L168 Benchmark]: Boogie Preprocessor took 32.50 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-16 00:36:30,223 INFO L168 Benchmark]: RCFGBuilder took 400.37 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-16 00:36:30,224 INFO L168 Benchmark]: BuchiAutomizer took 5826.00 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 979.7 MB in the end (delta: 117.3 MB). Peak memory consumption was 167.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:30,225 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 1.2 GB. Free memory is still 979.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:36:30,229 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 543.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.47 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 32.50 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 400.37 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 5826.00 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 979.7 MB in the end (delta: 117.3 MB). Peak memory consumption was 167.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.24 ms. Allocated memory is still 1.2 GB. Free memory is still 979.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + unknown-#length-unknown[arr] + -4 * j and consists of 4 locations. One deterministic module has affine ranking function limit + -1 * unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. One nondeterministic module has affine ranking function limit + -1 * 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 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 4.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 222 SDslu, 71 SDs, 0 SdLazy, 168 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax100 hnf98 lsp94 ukn79 mio100 lsp54 div100 bol100 ite100 ukn100 eq164 hnf89 smp96 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...