./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array06_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_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array06_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/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 f1115824e83a2d445d70fc62014a99239a945a9c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:14:05,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:14:05,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:14:05,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:14:05,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:14:05,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:14:05,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:14:05,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:14:05,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:14:05,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:14:05,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:14:05,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:14:05,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:14:05,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:14:05,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:14:05,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:14:05,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:14:05,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:14:05,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:14:05,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:14:05,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:14:05,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:14:05,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:14:05,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:14:05,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:14:05,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:14:05,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:14:05,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:14:05,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:14:05,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:14:05,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:14:05,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:14:05,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:14:05,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:14:05,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:14:05,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:14:05,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:14:05,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:14:05,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:14:05,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:14:05,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:14:05,692 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:14:05,719 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:14:05,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:14:05,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:14:05,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:14:05,721 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:14:05,721 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:14:05,722 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:14:05,722 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:14:05,722 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:14:05,722 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:14:05,722 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:14:05,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:14:05,723 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:14:05,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:14:05,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:14:05,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:14:05,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:14:05,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:14:05,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:14:05,724 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:14:05,724 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:14:05,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:14:05,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:14:05,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:14:05,725 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:14:05,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:14:05,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:14:05,726 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:14:05,727 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:14:05,727 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_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/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 -> f1115824e83a2d445d70fc62014a99239a945a9c [2019-11-15 21:14:05,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:14:05,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:14:05,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:14:05,787 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:14:05,789 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:14:05,790 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/bin/uautomizer/../../sv-benchmarks/c/termination-15/array06_alloca.i [2019-11-15 21:14:05,837 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/bin/uautomizer/data/0ddb3a4bb/ae0238daf52b4871bfbfcec7759435bb/FLAG0c4fa210e [2019-11-15 21:14:06,291 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:14:06,292 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/sv-benchmarks/c/termination-15/array06_alloca.i [2019-11-15 21:14:06,302 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/bin/uautomizer/data/0ddb3a4bb/ae0238daf52b4871bfbfcec7759435bb/FLAG0c4fa210e [2019-11-15 21:14:06,634 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/bin/uautomizer/data/0ddb3a4bb/ae0238daf52b4871bfbfcec7759435bb [2019-11-15 21:14:06,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:14:06,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:14:06,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:14:06,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:14:06,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:14:06,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:14:06" (1/1) ... [2019-11-15 21:14:06,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df6e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:06, skipping insertion in model container [2019-11-15 21:14:06,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:14:06" (1/1) ... [2019-11-15 21:14:06,651 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:14:06,686 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:14:07,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:14:07,134 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:14:07,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:14:07,231 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:14:07,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:07 WrapperNode [2019-11-15 21:14:07,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:14:07,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:14:07,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:14:07,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:14:07,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:07" (1/1) ... [2019-11-15 21:14:07,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:07" (1/1) ... [2019-11-15 21:14:07,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:14:07,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:14:07,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:14:07,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:14:07,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:07" (1/1) ... [2019-11-15 21:14:07,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:07" (1/1) ... [2019-11-15 21:14:07,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:07" (1/1) ... [2019-11-15 21:14:07,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:07" (1/1) ... [2019-11-15 21:14:07,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:07" (1/1) ... [2019-11-15 21:14:07,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:07" (1/1) ... [2019-11-15 21:14:07,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:07" (1/1) ... [2019-11-15 21:14:07,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:14:07,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:14:07,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:14:07,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:14:07,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc0a682d-ad4e-45a9-bd5c-a575c9f5439e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:14:07,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:14:07,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:14:07,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:14:07,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:14:07,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:14:07,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:14:07,531 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:14:07,531 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 21:14:07,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:07 BoogieIcfgContainer [2019-11-15 21:14:07,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:14:07,533 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:14:07,533 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:14:07,536 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:14:07,548 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:14:07,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:14:06" (1/3) ... [2019-11-15 21:14:07,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5059ace3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:14:07, skipping insertion in model container [2019-11-15 21:14:07,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:14:07,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:14:07" (2/3) ... [2019-11-15 21:14:07,550 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5059ace3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:14:07, skipping insertion in model container [2019-11-15 21:14:07,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:14:07,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:07" (3/3) ... [2019-11-15 21:14:07,551 INFO L371 chiAutomizerObserver]: Analyzing ICFG array06_alloca.i [2019-11-15 21:14:07,626 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:14:07,639 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:14:07,639 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:14:07,640 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:14:07,640 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:14:07,640 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:14:07,640 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:14:07,640 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:14:07,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-15 21:14:07,683 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-15 21:14:07,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:14:07,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:14:07,690 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:14:07,690 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:14:07,690 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:14:07,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-15 21:14:07,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-15 21:14:07,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:14:07,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:14:07,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:14:07,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:14:07,700 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 14#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 11#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 15#L370-3true [2019-11-15 21:14:07,701 INFO L793 eck$LassoCheckResult]: Loop: 15#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 13#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L370-3true [2019-11-15 21:14:07,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-15 21:14:07,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:07,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504868288] [2019-11-15 21:14:07,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:07,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:07,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:07,848 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:07,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:07,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-11-15 21:14:07,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:07,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637826439] [2019-11-15 21:14:07,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:07,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:07,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:07,864 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:07,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:07,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-11-15 21:14:07,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:07,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653235254] [2019-11-15 21:14:07,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:07,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:07,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:07,897 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:08,089 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-15 21:14:08,144 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:14:08,146 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:14:08,146 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:14:08,146 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:14:08,146 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:14:08,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:14:08,147 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:14:08,147 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:14:08,147 INFO L131 ssoRankerPreferences]: Filename of dumped script: array06_alloca.i_Iteration1_Lasso [2019-11-15 21:14:08,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:14:08,148 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:14:08,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:08,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:08,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:08,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:08,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:08,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:08,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:08,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:08,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:08,597 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:14:08,602 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:14:08,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:08,605 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:08,605 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:08,606 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:08,606 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:08,606 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:08,608 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:08,609 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:08,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:08,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:08,613 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:08,613 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:08,613 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:08,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:08,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:08,614 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:08,614 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:08,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:08,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:08,616 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:08,616 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:08,616 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:08,617 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:08,619 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:08,619 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:08,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:08,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:08,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:08,625 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:08,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:08,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:08,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:08,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:08,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:08,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:08,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:08,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:08,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:08,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:08,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:08,635 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:08,637 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:08,777 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:14:08,797 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:14:08,798 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:14:08,800 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:14:08,802 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:14:08,802 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:14:08,803 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-11-15 21:14:08,812 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 21:14:08,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:14:08,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:08,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:14:08,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:08,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:14:08,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:08,901 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:14:08,902 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-11-15 21:14:08,947 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 7 states. [2019-11-15 21:14:08,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:14:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:14:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-15 21:14:08,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 21:14:08,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:08,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 21:14:08,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:08,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 21:14:08,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:08,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-11-15 21:14:08,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 21:14:08,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2019-11-15 21:14:08,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 21:14:08,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 21:14:08,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-15 21:14:08,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:14:08,962 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 21:14:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-15 21:14:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-15 21:14:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 21:14:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-15 21:14:08,986 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 21:14:08,986 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-15 21:14:08,986 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:14:08,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-15 21:14:08,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 21:14:08,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:14:08,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:14:08,987 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:08,988 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 21:14:08,988 INFO L791 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 105#L367 assume !(main_~length~0 < 1); 108#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 109#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 110#L370-3 assume !(main_~i~0 < main_~length~0); 106#L370-4 main_~j~0 := 0; 103#L374-2 [2019-11-15 21:14:08,988 INFO L793 eck$LassoCheckResult]: Loop: 103#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; 103#L374-2 [2019-11-15 21:14:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:08,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2019-11-15 21:14:08,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:08,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578601906] [2019-11-15 21:14:08,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:08,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:08,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:09,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578601906] [2019-11-15 21:14:09,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:14:09,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:14:09,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72524000] [2019-11-15 21:14:09,032 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:14:09,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2019-11-15 21:14:09,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:09,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973739925] [2019-11-15 21:14:09,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:09,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:09,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:09,051 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:09,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:14:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:14:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:14:09,100 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-15 21:14:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:14:09,129 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-11-15 21:14:09,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:14:09,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-15 21:14:09,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 21:14:09,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-11-15 21:14:09,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 21:14:09,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 21:14:09,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-11-15 21:14:09,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:14:09,132 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-15 21:14:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-11-15 21:14:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-15 21:14:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 21:14:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-11-15 21:14:09,134 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-15 21:14:09,134 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-15 21:14:09,134 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:14:09,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-11-15 21:14:09,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 21:14:09,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:14:09,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:14:09,137 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:14:09,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 21:14:09,137 INFO L791 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_#t~post210, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 133#L367 assume !(main_~length~0 < 1); 136#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 137#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 139#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 140#L370-3 assume !(main_~i~0 < main_~length~0); 134#L370-4 main_~j~0 := 0; 131#L374-2 [2019-11-15 21:14:09,138 INFO L793 eck$LassoCheckResult]: Loop: 131#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset, 4);main_#t~post210 := main_#t~mem209;call write~int(1 + main_#t~post210, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 + main_#t~post210;havoc main_#t~post210;havoc main_#t~mem209; 131#L374-2 [2019-11-15 21:14:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2019-11-15 21:14:09,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:09,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550277009] [2019-11-15 21:14:09,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:09,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:09,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:09,181 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:09,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:09,182 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2019-11-15 21:14:09,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:09,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748521604] [2019-11-15 21:14:09,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:09,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:09,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:09,203 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:09,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:09,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2019-11-15 21:14:09,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:14:09,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130940447] [2019-11-15 21:14:09,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:09,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:14:09,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:14:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:14:09,250 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:14:09,436 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-11-15 21:14:09,494 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:14:09,494 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:14:09,494 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:14:09,494 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:14:09,495 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:14:09,495 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:14:09,495 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:14:09,495 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:14:09,495 INFO L131 ssoRankerPreferences]: Filename of dumped script: array06_alloca.i_Iteration3_Lasso [2019-11-15 21:14:09,495 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:14:09,495 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:14:09,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:09,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:09,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:09,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:09,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:09,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:09,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:09,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:14:09,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-15 21:14:09,894 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:14:09,895 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:14:09,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-15 21:14:09,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:09,897 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:09,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:09,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:09,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:09,897 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:09,898 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:09,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:09,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:09,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:09,899 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:09,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:09,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:09,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:09,900 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:09,900 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:09,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:09,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:09,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:09,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:09,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:09,902 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:09,911 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:09,911 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:09,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:09,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:09,919 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:09,920 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:09,920 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:09,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:09,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:09,922 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:09,922 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:09,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:09,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:09,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:09,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:09,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:09,925 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:09,929 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:09,931 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:09,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:09,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:09,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:09,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:09,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:09,936 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:09,945 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:09,947 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:09,986 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:09,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:09,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:09,991 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:14:09,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:09,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:09,994 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:14:09,995 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:10,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:10,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:10,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:10,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:10,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:10,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:10,017 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:10,017 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:10,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:10,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:10,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:10,029 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:10,030 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:10,030 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:10,030 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:10,030 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:10,030 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:10,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:10,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:10,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:10,032 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:10,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:10,033 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:10,036 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:10,036 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:10,036 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:10,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:10,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:10,040 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:10,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:10,040 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:10,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:10,043 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:14:10,043 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:14:10,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:10,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:10,056 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:10,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:10,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:10,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:10,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:14:10,058 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:14:10,058 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:10,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:10,059 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 21:14:10,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:10,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:10,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:10,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:10,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:10,061 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:14:10,061 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:14:10,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:10,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:10,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:10,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:10,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:10,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:10,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:10,065 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:14:10,065 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:14:10,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:10,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:10,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:10,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:10,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:10,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:10,068 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:14:10,075 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 21:14:10,075 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 21:14:10,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:10,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:10,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:10,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:14:10,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:10,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:10,083 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:14:10,084 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:14:10,084 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:14:10,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:10,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:10,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:10,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:10,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:10,086 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:14:10,088 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 21:14:10,088 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 21:14:10,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:14:10,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:14:10,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:14:10,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:14:10,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:14:10,093 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:14:10,103 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 21:14:10,103 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 21:14:10,188 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:14:10,238 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-15 21:14:10,238 INFO L444 ModelExtractionUtils]: 35 out of 46 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-15 21:14:10,239 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:14:10,240 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2019-11-15 21:14:10,241 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:14:10,241 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_1 + 1 f1 = -2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-15 21:14:10,254 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 21:14:10,256 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:14:10,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:14:10,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:14:10,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:14:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:10,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:14:10,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:14:10,308 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:14:10,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:14:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:14:10,309 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 21:14:10,309 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-15 21:14:10,316 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 13 transitions. Complement of second has 2 states. [2019-11-15 21:14:10,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-11-15 21:14:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 21:14:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2019-11-15 21:14:10,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 1 letters. [2019-11-15 21:14:10,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:10,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 10 letters. Loop has 1 letters. [2019-11-15 21:14:10,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:10,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 21:14:10,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:14:10,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-15 21:14:10,319 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:14:10,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2019-11-15 21:14:10,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:14:10,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:14:10,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:14:10,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:14:10,320 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:14:10,320 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:14:10,320 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:14:10,320 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:14:10,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:14:10,321 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:14:10,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:14:10,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:14:10 BoogieIcfgContainer [2019-11-15 21:14:10,328 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:14:10,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:14:10,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:14:10,329 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:14:10,329 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:14:07" (3/4) ... [2019-11-15 21:14:10,333 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:14:10,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:14:10,335 INFO L168 Benchmark]: Toolchain (without parser) took 3696.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 939.3 MB in the beginning and 831.7 MB in the end (delta: 107.6 MB). Peak memory consumption was 270.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:10,336 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:14:10,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 594.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -200.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:10,337 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.84 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:10,338 INFO L168 Benchmark]: Boogie Preprocessor took 22.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:10,338 INFO L168 Benchmark]: RCFGBuilder took 235.38 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: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:10,340 INFO L168 Benchmark]: BuchiAutomizer took 2795.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 831.7 MB in the end (delta: 277.6 MB). Peak memory consumption was 277.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:14:10,340 INFO L168 Benchmark]: Witness Printer took 4.35 ms. Allocated memory is still 1.2 GB. Free memory is still 831.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:14:10,349 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 594.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -200.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.84 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 235.38 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: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2795.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 831.7 MB in the end (delta: 277.6 MB). Peak memory consumption was 277.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.35 ms. Allocated memory is still 1.2 GB. Free memory is still 831.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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * arr + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has 2-nested ranking function (if -2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then 1 else 0), (if -2 * unknown-#memory_int-unknown[arr][arr] + 1 > 0 then -2 * unknown-#memory_int-unknown[arr][arr] + 1 else -2 * j + 2 * length) and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30 SDtfs, 33 SDslu, 12 SDs, 0 SdLazy, 23 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital112 mio100 ax100 hnf99 lsp94 ukn78 mio100 lsp65 div100 bol100 ite100 ukn100 eq168 hnf91 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...